oj.uz

Submission #586502

# Submission time Handle Problem Language Result Execution time Memory
586502 2022-06-30T10:52:50 Z krit3379 Best Place (NOI17_bestplace) C++17
100 / 100
 38 ms 3020 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 100005

int x[N],y[N];

int main(){
    int n,i;
    scanf("%d",&n);
    for(i=0;i<n;i++)scanf("%d %d",&x[i],&y[i]);
    sort(x,x+n);
    sort(y,y+n);
    printf("%d %d",x[n/2],y[n/2]);
    return 0;
}

Compilation message

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

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2144 KB Output is correct
2 Correct 27 ms 2132 KB Output is correct
3 Correct 25 ms 2236 KB Output is correct
4 Correct 20 ms 2208 KB Output is correct
5 Correct 24 ms 2260 KB Output is correct
6 Correct 26 ms 2156 KB Output is correct
7 Correct 24 ms 2064 KB Output is correct
8 Correct 25 ms 2260 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 2896 KB Output is correct
2 Correct 35 ms 3000 KB Output is correct
3 Correct 27 ms 2996 KB Output is correct
4 Correct 34 ms 2260 KB Output is correct
5 Correct 36 ms 2992 KB Output is correct
6 Correct 35 ms 3020 KB Output is correct
7 Correct 35 ms 2928 KB Output is correct
8 Correct 35 ms 2920 KB Output is correct