Submission #12838

# Submission time Handle Problem Language Result Execution time Memory
12838 2015-01-10T00:12:49 Z yongwhan 덩치 (KOI13_body) C++
0 / 18
0 ms 1676 KB
#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 time Memory Grader output
1 Incorrect 0 ms 1676 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1676 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1676 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1676 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1676 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1676 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1676 KB Output isn't correct
2 Halted 0 ms 0 KB -