Submission #1173

#TimeUsernameProblemLanguageResultExecution timeMemory
1173kriii점 모으기 (KOI13_collect)C++98
24 / 24
23 ms964 KiB
#include <stdio.h> int N,M,A,X[2][10010],x,y; int main() { int i,j,c; scanf ("%d %d",&N,&M); for (i=0;i<M;i++){ scanf ("%d %d",&x,&y); X[0][x]++; X[1][y]++; } for (j=0;j<2;j++){ c = 0; for (i=1;i<=N;i++){ c += X[j][i]; if (c >= (M + 1) / 2) break; } x = i; for (i=x-1;i>=1;i--) A += (x - i) * X[j][i]; for (i=x+1;i<=N;i++) A += (i - x) * X[j][i]; } printf ("%d",A); 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...
#Verdict Execution timeMemoryGrader output
Fetching results...