oj.uz

Submission #936338

# Submission time Handle Problem Language Result Execution time Memory
936338 2024-03-01T16:04:15 Z BbtT Best Place (NOI17_bestplace) C++17
100 / 100
 29 ms 3268 KB 
#include<bits/stdc++.h>

using namespace std;

int main(){

    int N;
    cin>>N;
    int x[N+5],y[N+5];
    for(int i=0;i<N;i++){
        scanf("%d%d",x+i,y+i);
    }
    sort(x,x+N);
    sort(y,y+N);
    cout<<x[N/2]<<" "<<y[N/2]<<endl;


    return 0;
}

Compilation message

bestplace.cpp: In function 'int main()':
bestplace.cpp:11:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         scanf("%d%d",x+i,y+i);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 412 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1112 KB Output is correct
2 Correct 21 ms 2140 KB Output is correct
3 Correct 21 ms 2140 KB Output is correct
4 Correct 16 ms 2216 KB Output is correct
5 Correct 20 ms 2140 KB Output is correct
6 Correct 21 ms 2140 KB Output is correct
7 Correct 21 ms 2084 KB Output is correct
8 Correct 21 ms 2140 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 544 KB Output is correct
8 Correct 0 ms 436 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 1116 KB Output is correct
2 Correct 29 ms 3268 KB Output is correct
3 Correct 20 ms 3164 KB Output is correct
4 Correct 28 ms 2396 KB Output is correct
5 Correct 29 ms 2908 KB Output is correct
6 Correct 29 ms 3160 KB Output is correct
7 Correct 29 ms 2908 KB Output is correct
8 Correct 29 ms 2908 KB Output is correct