Submission #7018281
Source Code Expand
#include <bits/stdc++.h> const int MOD = 1000000007; #define rep(i, n) for(int i = 0; i < (int)(n); i++) #define copy(from, to) copy(from.begin(), from.end(), back_inserter(to)) #define sort(a) sort(a.begin(), a.end()) #define reverse(s) reverse(s.begin(), s.end()) #define p(s) cout << (s) << endl typedef long long ll; using namespace std; template<class T> void load(vector<T> &v, int n) { for (int i = 0; i < n; ++i) { T t; cin >> t; v.push_back(t); } } template<class T> T max(vector<T> &v) { return *max_element(v.begin(), v.end()); } template<class T> T min(vector<T> &v) { return *min_element(v.begin(), v.end()); } void py(bool isUpper = false) { if (isUpper) { p("YES"); } else { p("Yes"); } } void pn(bool isUpper = false) { if (isUpper) { p("NO"); } else { p("No"); } } int main() { int n; cin >> n; vector<int> a; load(a, n); sort(a); a.erase(unique(a.begin(), a.end()), a.end()); p(a.size()); }
Submission Info
Submission Time | |
---|---|
Task | B - Kagami Mochi |
User | karayuu |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1037 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 |