# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
202035 | 2020-02-13T07:12:27 Z | blacktulip | Just Long Neckties (JOI20_ho_t1) | C++14 | 5 ms | 380 KB |
#include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define mp make_pair #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo MAX = -1000000000000000000; const lo MIN = 1000000000000000000; const lo inf = 1000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t; int cev; string s; set<int> st; PII p[li]; vector<int> v; int main(void){ scanf("%d",&n); //~ scanf("%d",&n); for(int i=1;i<=n+1;i++){ scanf("%lld",&p[i].fi); p[i].se=i; } FOR{ scanf("%d",&a[i]); } sort(a+1,a+n+1); for(int i=1;i<=n+1;i++){ st.clear(); for(int j=1;j<=n+1;j++){ if(j==i)continue; st.insert(p[j].fi); } cev=0; auto it=st.begin(); FOR{ cev=max(cev,abs(a[i]-*it)); //~ cout<<a[i]-*it<<endl; it++; } printf("%d ",cev); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Incorrect | 5 ms | 380 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Incorrect | 5 ms | 380 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Incorrect | 5 ms | 380 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |