oj.uz

Submission #425449

# Submission time Handle Problem Language Result Execution time Memory
425449 2021-06-13T03:58:45 Z errorgorn Best Place (NOI17_bestplace) C++17
100 / 100
 57 ms 3252 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n;
vector<int> vx,vy;
int main(){
    scanf("%d",&n);
    int a,b;
    for (int x=0;x<n;x++){
        scanf("%d%d",&a,&b);
        vx.push_back(a);
        vy.push_back(b);
    }
    sort(vx.begin(),vx.end());
    sort(vy.begin(),vy.end());
    printf("%d %d\n",vx[n>>1],vy[n>>1]);
}

Compilation message

bestplace.cpp: In function 'int main()':
bestplace.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
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",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 280 KB Output is correct
3 Correct 1 ms 284 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2324 KB Output is correct
2 Correct 39 ms 2376 KB Output is correct
3 Correct 33 ms 2404 KB Output is correct
4 Correct 28 ms 2444 KB Output is correct
5 Correct 33 ms 2436 KB Output is correct
6 Correct 34 ms 2368 KB Output is correct
7 Correct 40 ms 2348 KB Output is correct
8 Correct 34 ms 2380 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 276 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 276 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 3164 KB Output is correct
2 Correct 45 ms 3184 KB Output is correct
3 Correct 34 ms 3252 KB Output is correct
4 Correct 45 ms 2488 KB Output is correct
5 Correct 46 ms 3152 KB Output is correct
6 Correct 48 ms 3136 KB Output is correct
7 Correct 45 ms 3136 KB Output is correct
8 Correct 45 ms 3208 KB Output is correct