oj.uz

Submission #1078

# Submission time Handle Problem Language Result Execution time Memory
1078 2013-06-24T17:24:05 Z tncks0121 덩치 (KOI13_body) C++
18 / 18
 0 ms 884 KB 
#include <stdio.h>
FILE *in=stdin;
FILE *out=stdout;
int n, k;
int x[100], y[100], cnt;
int main() {
int i, j;
fscanf(in, "%d", &n);
for (i=1;i<=n;i++)
fscanf(in, "%d%d", &x[i], &y[i]);
for (i=1;i<=n;i++) {
cnt = 1;
for (j=1;j<=n;j++) {
if (i != j) {
if (x[j] > x[i] && y[j] > y[i])
cnt++;
}
}fprintf(out, "%d ", cnt);
}fprintf(out, "\n");
return 0;
}

Subtask #1
2.7 / 2.7

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

Subtask #2
2.7 / 2.7

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

Subtask #3
2.7 / 2.7

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

Subtask #4
2.7 / 2.7

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

Subtask #5
2.7 / 2.7

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

Subtask #6
2.7 / 2.7

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

Subtask #7
1.8 / 1.8

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