#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mkp make_pair
#define MEM(x) memset(x,0,sizeof(x))
#define ALL(x) begin(x), end(x)
#define PH push
#define PB push_back
#define REP(i,N) for( int i = 0; i <(N); ++i )
#define FOR(i,a,b) for( int i = (a); i <= (b); ++i )
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
template<typename T>
using V = vector<T>;
void solve() {
int N; cin >> N;
set< int > st;
REP(i,N) {
int x, e; cin >> x >> e;
st.insert( x );
}
cout<<st.size() <<'\n';
}
int main () {
int T=1;
#ifdef LOCAL
freopen( "input.txt", "r", stdin );
freopen( "output.txt", "w", stdout );
cin >> T;
#else
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif
while(T--) solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
48 ms |
8184 KB |
Output is correct |
3 |
Correct |
56 ms |
7288 KB |
Output is correct |
4 |
Correct |
97 ms |
9460 KB |
Output is correct |
5 |
Correct |
58 ms |
6568 KB |
Output is correct |
6 |
Correct |
290 ms |
30916 KB |
Output is correct |
7 |
Correct |
211 ms |
20200 KB |
Output is correct |
8 |
Correct |
105 ms |
10144 KB |
Output is correct |
9 |
Correct |
73 ms |
10156 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
48 ms |
8184 KB |
Output is correct |
3 |
Correct |
56 ms |
7288 KB |
Output is correct |
4 |
Correct |
97 ms |
9460 KB |
Output is correct |
5 |
Correct |
58 ms |
6568 KB |
Output is correct |
6 |
Correct |
290 ms |
30916 KB |
Output is correct |
7 |
Correct |
211 ms |
20200 KB |
Output is correct |
8 |
Correct |
105 ms |
10144 KB |
Output is correct |
9 |
Correct |
73 ms |
10156 KB |
Output is correct |
10 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |