oj.uz

답안 #226460

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
226460 2020-04-23T20:59:42 Z thebes Just Long Neckties (JOI20_ho_t1) C++14
0 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

const int MN = 2e5+5;
int N, i, b[MN], ans[MN];
pii a[MN];
multiset<int> dif;

int main(){
    for(scanf("%d",&N),i=1;i<=N+1;i++){
        scanf("%d",&a[i].first);
        a[i].second=i;
    }
    for(i=1;i<=N;i++)
        scanf("%d",&b[i]);
    sort(b+1,b+N+1);
    sort(a+1,a+N+2,[](pii i,pii j){return i.first<j.first;});
    for(i=1;i<=N;i++)
        dif.insert(abs(a[i].first-b[i]));
    for(i=N+1;i>=1;i--){
        auto it=dif.end(); it--;
        ans[a[i].second]=*it;
        if(i!=1){
            int ot = i-1;
            dif.erase(dif.find(abs(a[i-1].first-b[ot])));
            dif.insert(abs(a[i].first-b[ot]));
        }
    }
    for(i=1;i<=N+1;i++)
        printf("%d ",ans[i]);
    printf("\n");
    return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:13:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(scanf("%d",&N),i=1;i<=N+1;i++){
         ~~~~~~~~~~~~~~^~~~
ho_t1.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a[i].first);
         ~~~~~^~~~~~~~~~~~~~~~~~
ho_t1.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&b[i]);
         ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -