oj.uz

Submission #12839

# Submission time Handle Problem Language Result Execution time Memory
12839 2015-01-10T00:14:48 Z yongwhan 덩치 (KOI13_body) C++
18 / 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].second) ret[i]++;
    }
  }

  for (int i=0; i<n; i++) {
    if(i) cout << " ";
    cout << ret[i]+1;
  }
  cout << endl;
  return 0;
}

Subtask #1
2.7 / 2.7

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1676 KB Output is correct
2 Correct 0 ms 1676 KB Output is correct
3 Correct 0 ms 1676 KB Output is correct

Subtask #2
2.7 / 2.7

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1676 KB Output is correct
2 Correct 0 ms 1676 KB Output is correct
3 Correct 0 ms 1676 KB Output is correct

Subtask #3
2.7 / 2.7

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1676 KB Output is correct
2 Correct 0 ms 1676 KB Output is correct
3 Correct 0 ms 1676 KB Output is correct

Subtask #4
2.7 / 2.7

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1676 KB Output is correct
2 Correct 0 ms 1676 KB Output is correct
3 Correct 0 ms 1676 KB Output is correct

Subtask #5
2.7 / 2.7

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1676 KB Output is correct
2 Correct 0 ms 1676 KB Output is correct
3 Correct 0 ms 1676 KB Output is correct

Subtask #6
2.7 / 2.7

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1676 KB Output is correct
2 Correct 0 ms 1676 KB Output is correct
3 Correct 0 ms 1676 KB Output is correct

Subtask #7
1.8 / 1.8

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1676 KB Output is correct
2 Correct 0 ms 1676 KB Output is correct