Submission #12838

#TimeUsernameProblemLanguageResultExecution timeMemory
12838yongwhan덩치 (KOI13_body)C++98
0 / 18
0 ms1676 KiB
#include<iostream> #include<utility> #include<vector> using namespace std; typedef pair<int,int> ii; int main() { int n; cin>>n; vector<ii> v(n); for (int i=0; i<n; i++) { int x,y; cin>>x>>y; v[i]=make_pair(x,y); } vector<int> ret(n); for (int i=0; i<n; i++) { for (int j=0; j<n; j++) if(i!=j) { if(v[j].first>v[i].first && v[j].second>v[i].first) ret[i]++; } } for (int i=0; i<n; i++) { if(i) cout << " "; cout << ret[i]+1; } cout << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...