# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
293168 | 2020-09-07T17:21:55 Z | Berted | Best Place (NOI17_bestplace) | C++14 | 196 ms | 4192 KB |
#include <iostream> #include <vector> #include <algorithm> #define pub push_back #define ll long long using namespace std; const ll inft = 10000000000; vector<ll> x,y; ll as (ll n) {if (n<0) {return -n;} else {return n;}} ll medianx() { if (x.size()%2) {return x[x.size()/2];} else {return (x[x.size()/2-1] + x[x.size()/2])/2;} } ll mediany() { if (y.size()%2) {return y[y.size()/2];} else {return (y[y.size()/2-1] + y[y.size()/2])/2;} } int main() { ll n,xt=0,yt=0,xmn=inft,ymn=inft,xmx=-1,ymx=-1,xrmin=inft,yrmin=inft,xrminr = inft,yrminr = inft; cin>>n; for (ll i=0;i<n;i++) { ll tx,ty;cin>>tx>>ty; xt+=tx;yt+=ty; xmx = max(xmx,tx);ymx = max(ymx,ty); xmn = min(xmn,tx);ymn = min(ymn,ty); x.pub(tx);y.pub(ty); } sort(x.begin(),x.end());sort(y.begin(),y.end()); cout<<medianx()<<" "<<mediany()<<"\n"; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
4 | Correct | 1 ms | 256 KB | Output is correct |
5 | Correct | 1 ms | 256 KB | Output is correct |
6 | Correct | 1 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 110 ms | 3172 KB | Output is correct |
2 | Correct | 123 ms | 3328 KB | Output is correct |
3 | Correct | 125 ms | 3296 KB | Output is correct |
4 | Correct | 120 ms | 3380 KB | Output is correct |
5 | Correct | 122 ms | 3300 KB | Output is correct |
6 | Correct | 125 ms | 3304 KB | Output is correct |
7 | Correct | 119 ms | 3344 KB | Output is correct |
8 | Correct | 124 ms | 3296 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 256 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 256 KB | Output is correct |
5 | Correct | 1 ms | 256 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
8 | Correct | 1 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
4 | Correct | 2 ms | 384 KB | Output is correct |
5 | Correct | 3 ms | 396 KB | Output is correct |
6 | Correct | 3 ms | 376 KB | Output is correct |
7 | Correct | 3 ms | 384 KB | Output is correct |
8 | Correct | 2 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 191 ms | 4068 KB | Output is correct |
2 | Correct | 194 ms | 4104 KB | Output is correct |
3 | Correct | 176 ms | 4088 KB | Output is correct |
4 | Correct | 133 ms | 3356 KB | Output is correct |
5 | Correct | 189 ms | 4068 KB | Output is correct |
6 | Correct | 188 ms | 4192 KB | Output is correct |
7 | Correct | 186 ms | 4040 KB | Output is correct |
8 | Correct | 196 ms | 4068 KB | Output is correct |