Submission #320857

# Submission time Handle Problem Language Result Execution time Memory
320857 2020-11-10T05:55:07 Z ishi_10 Best Place (NOI17_bestplace) C++14
3 / 100
85 ms 3172 KB
#include<iostream>
#include<cmath>
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
typedef long long int ll;
const ll maxn=1e5+2;
int main()
{
    ll n;
    cin>>n;
    ll a[n][2],i;
    ll mx=0,my=0,mix=1e10,miy=1e10;
    for(i=0;i<n;i++)
    {
        cin>>a[i][0]>>a[i][1];
        if(a[i][0]>mx)
            mx=a[i][0];
        if(a[i][0]<mix)
            mix=a[i][0];
        if(a[i][1]>my)
            my=a[i][1];
        if(a[i][1]<miy)
            miy=a[i][1];
    }
    ll x=(mx+mix)/2;
    ll y=(my+miy)/2;
    cout<<x<<" "<<y<<"\n";
    cerr<<"\nTime elapsed:"<< 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 58 ms 2916 KB Output is correct
2 Incorrect 61 ms 3044 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 85 ms 3172 KB Output isn't correct
2 Halted 0 ms 0 KB -