oj.uz

답안 #701982

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
701982 2023-02-22T12:21:35 Z huomark1001 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 242 ms 23336 KB 
#include<bits/stdc++.h>
#include<random>
using namespace std;

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

#define float double
#define ss(n) fixed<<setprecision(n) 
#define ll long long
#define int ll
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define ld long double
#define pb push_back
#define pii pair<int,int>
#define rep(i,a) for(int i=1;i<=a;i++)
#define rep0(i,a) for(int i=0;i<a;i++)
#define F first
#define S second
#define uni(a) a.resize(distance(a.begin(),unique(a.begin(),a.end())));
#define unisort(a) sort(a.begin(),a.end()); uni(a);

ll gcd(ll a,ll b){if(b==0) return a; return gcd(b,a%b);}

const ld pi=3.14159265358979323846264338327950288419716939931;
const int lar=3e18;
const int mol1=1e9+7;
const int mol2=998244353;
const int MX=3e5;

void solve()
{
    int n;
    cin>>n;
    int a[n+2];
    rep(i,n+1) cin>>a[i];
    int b[n+1];
    rep(i,n) cin>>b[i];
    int ans[n+2];
    vector<pair<int,int>>aa;
    rep(i,n+1){
        aa.pb({a[i],i});
    }
    sort(aa.begin(),aa.end());
    sort(b+1,b+n+1);
    multiset<int,greater<>>all;
    rep0(i,aa.size()){
        if(i==0) continue;
        int nn=aa[i].F;
        all.insert(nn-b[i]);
    }
    ans[aa[0].S]=*all.begin();
    for(int i=1;i<aa.size();i++){
        all.insert(aa[i-1].F-b[i]);
        all.erase(all.find(aa[i].F-b[i]));
        ans[aa[i].S]=*all.begin();
    }
    rep(i,n+1) cout<<ans[i]<<" ";
    
}           

signed main()
{
    IO
    solve();
    return 0;
}

Compilation message

ho_t1.cpp: In function 'void solve()':
ho_t1.cpp:18:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | #define rep0(i,a) for(int i=0;i<a;i++)
......
   48 |     rep0(i,aa.size()){
      |          ~~~~~~~~~~~            
ho_t1.cpp:48:5: note: in expansion of macro 'rep0'
   48 |     rep0(i,aa.size()){
      |     ^~~~
ho_t1.cpp:54:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i=1;i<aa.size();i++){
      |                 ~^~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 224 KB Output is correct
10 Correct 0 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 224 KB Output is correct
10 Correct 0 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 388 KB Output is correct
15 Correct 2 ms 484 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 484 KB Output is correct
24 Correct 2 ms 464 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 224 KB Output is correct
10 Correct 0 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 388 KB Output is correct
15 Correct 2 ms 484 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 484 KB Output is correct
24 Correct 2 ms 464 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 171 ms 21844 KB Output is correct
34 Correct 178 ms 22776 KB Output is correct
35 Correct 180 ms 22152 KB Output is correct
36 Correct 172 ms 22616 KB Output is correct
37 Correct 177 ms 23336 KB Output is correct
38 Correct 183 ms 23012 KB Output is correct
39 Correct 213 ms 21944 KB Output is correct
40 Correct 221 ms 21760 KB Output is correct
41 Correct 228 ms 22100 KB Output is correct
42 Correct 221 ms 22024 KB Output is correct
43 Correct 237 ms 21984 KB Output is correct
44 Correct 203 ms 21216 KB Output is correct
45 Correct 183 ms 21436 KB Output is correct
46 Correct 186 ms 21332 KB Output is correct
47 Correct 159 ms 21932 KB Output is correct
48 Correct 154 ms 21884 KB Output is correct
49 Correct 242 ms 22736 KB Output is correct
50 Correct 233 ms 22572 KB Output is correct
51 Correct 233 ms 22548 KB Output is correct
52 Correct 237 ms 22456 KB Output is correct
53 Correct 231 ms 22584 KB Output is correct