oj.uz

Submission #1159

# Submission time Handle Problem Language Result Execution time Memory
1159 2013-06-28T09:54:08 Z kriii 덩치 (KOI13_body) C++
18 / 18
 0 ms 884 KB 
#include <stdio.h>

int N,X[55],Y[55],R[55];

int main()
{
	int i,j;

	scanf ("%d",&N);
	for (i=0;i<N;i++) scanf ("%d %d",&X[i],&Y[i]);
	for (i=0;i<N;i++){
		for (j=0;j<N;j++) if (X[i] < X[j] && Y[i] < Y[j]) R[i]++;
	}
	for (i=0;i<N;i++) printf ("%d ",R[i]+1);

	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