제출 #1135194

#제출 시각아이디문제언어결과실행 시간메모리
1135194ByeWorldAdvertisement 2 (JOI23_ho_t2)C++20
10 / 100
587 ms29448 KiB
#include <bits/stdc++.h> #define int long long #define ll long long #define pb push_back #define fi first #define se second #define lf (id<<1) #define rg ((id<<1)|1) #define md ((l+r)>>1) #define ld long double using namespace std; typedef pair<int,int> pii; typedef pair<char,char> pcc; typedef pair<int,pii> ipii; typedef pair<pii,pii> ipiii; const int MAXN = 5e5+30; const int SQRT = 610; const int MAXA = 5e5+10; const int MOD = 1e6+7; const int INF = 2e9+10; const int LOG = 19; const ld EPS = 1e-12; void chmx(int &a, int b){ a = max(a,b); } int n, x[MAXN], e[MAXN]; set <int> s; signed main(){ cin >> n; for(int i=1; i<=n; i++){ cin>>x[i]>>e[i]; s.insert(x[i]); } cout << s.size() << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...