oj.uz

Submission #493513

# Submission time Handle Problem Language Result Execution time Memory
493513 2021-12-11T19:16:03 Z Overloaded Best Place (NOI17_bestplace) C++17
100 / 100
 94 ms 3984 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef float ff;
typedef vector<long long int> vi;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) (int)x.size()
#define pb(x) push_back(x)
#define endl "\n"

int txtinput(){
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    return 0;
}

int solve(){
    ll t,x1,y1; cin>>t;
    vi x;
    vi y;
    for (ll i = 0; i < t; i++)
    {
        cin>>x1>>y1;
        x.pb(x1);y.pb(y1);
    }

    sort(all(x)); sort(all(y));
    
    cout<<x[t/2]<<" "<<y[t/2];

    return 0;
}


int main(){
    
    //txtinput();
    //ll t;
    //cin>>t;
    
    //while(t--){
        solve();
    //}
    
    return 0;
}

Compilation message

bestplace.cpp: In function 'int txtinput()':
bestplace.cpp:14:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bestplace.cpp:15:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 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 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 57 ms 2012 KB Output is correct
2 Correct 64 ms 2068 KB Output is correct
3 Correct 62 ms 3136 KB Output is correct
4 Correct 57 ms 3188 KB Output is correct
5 Correct 59 ms 3164 KB Output is correct
6 Correct 65 ms 3220 KB Output is correct
7 Correct 61 ms 3244 KB Output is correct
8 Correct 64 ms 3176 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 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 0 ms 204 KB Output is correct
8 Correct 0 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 312 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 308 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 2216 KB Output is correct
2 Correct 86 ms 3984 KB Output is correct
3 Correct 86 ms 3928 KB Output is correct
4 Correct 66 ms 3256 KB Output is correct
5 Correct 94 ms 3972 KB Output is correct
6 Correct 88 ms 3944 KB Output is correct
7 Correct 84 ms 3936 KB Output is correct
8 Correct 85 ms 3936 KB Output is correct