Submission #1949080
Source Code Expand
#include <iostream> #include <iomanip> #include <sstream> #include <vector> #include <string> #include <set> #include <map> #include <stack> #include <queue> #include <deque> #include <algorithm> #include <functional> #include <iterator> #include <limits> #include <numeric> #include <utility> #include <cmath> #include <cassert> #include <cstdio> // #include <unordered_set> // #include <unordered_map> #define rep(i, a, n) for(int i = a; i < n; i++) #define REP(i, n) rep(i, 0, n) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define SORT(c) sort((c).begin(),(c).end()) #define RSORT(c) sort((c).rbegin(),(c).rend()) #define pb push_back #define mp make_pair int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;} int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;} typedef std::pair<int, int> P; typedef long long ll; typedef long double ld; const int MOD = 1000000007; const int INF = 1e9; const ll LINF = INF * 1ll * INF; const ld DINF = 1e200; const double EPS = 1e-10; const double PI = acos(-1.0); using namespace std; #define N 1000000 int arr[N]; int a[N]; void eratosthenes(){ REP(i,N){ arr[i]=1; } for(int i=2;i<sqrt(N);i++){ if(arr[i]){ for(int j=0;i*(j+2)<N;j++){ arr[i*(j+2)]=0; } } } arr[0]=0; arr[1]=0; } signed main(){ int n; cin>>n; vector<int> v; REP(i,n){ int tmp; cin>>tmp; v.pb(tmp); } v.pb(-1); sort(v.rbegin(),v.rend()); int ans=0; int count=0; // cout<<v[0]<<endl; REP(i,n){ // if(count==3)break; ans++; if(v[i]!=v[i+1])count++; // cout<<v[i]<<" "<<ans<<" "<<count<<endl; } // cout<<ans<<endl; cout<<count<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Kagami Mochi |
User | Agodoriru |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1910 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03 |
All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
b04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 1 ms | 256 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 1 ms | 256 KB |
b09 | AC | 1 ms | 256 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |
b13 | AC | 1 ms | 256 KB |