Submission #320857

#TimeUsernameProblemLanguageResultExecution timeMemory
320857ishi_10Best Place (NOI17_bestplace)C++14
3 / 100
85 ms3172 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...