oj.uz

Submission #243952

# Submission time Handle Problem Language Result Execution time Memory
243952 2020-07-02T11:12:51 Z mhy908 Best Place (NOI17_bestplace) C++14
100 / 100
 57 ms 3832 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
#define lb(x, v) lower_bound(x.begin(), x.end(), v)
#define ub(x, v) upper_bound(x.begin(), x.end(), v)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
const LL llinf=2000000000000000000;
const LL mod1=1000000007;
const LL mod2=998244353;
const int inf=2000000000;
int n;
LL x[100010], y[100010];
int main(){
    scanf("%d", &n);
    for(int i=1; i<=n; i++)scanf("%lld %lld", &x[i], &y[i]);
    sort(x+1, x+n+1);
    sort(y+1, y+n+1);
    printf("%lld %lld", x[(n+1)/2], y[(n+1)/2]);
}

Compilation message

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

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2944 KB Output is correct
2 Correct 42 ms 3072 KB Output is correct
3 Correct 39 ms 3064 KB Output is correct
4 Correct 30 ms 3064 KB Output is correct
5 Correct 37 ms 3064 KB Output is correct
6 Correct 40 ms 3064 KB Output is correct
7 Correct 38 ms 2944 KB Output is correct
8 Correct 38 ms 3072 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 3832 KB Output is correct
2 Correct 56 ms 3832 KB Output is correct
3 Correct 41 ms 3832 KB Output is correct
4 Correct 49 ms 3064 KB Output is correct
5 Correct 57 ms 3832 KB Output is correct
6 Correct 51 ms 3832 KB Output is correct
7 Correct 56 ms 3832 KB Output is correct
8 Correct 56 ms 3832 KB Output is correct