oj.uz

답안 #596027

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596027 2022-07-14T09:22:17 Z ioi Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 105 ms 13932 KB 
#include<bits/stdc++.h>

using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define inF freopen("cardgame.in" , "r" , stdin);
#define outF freopen("cardgame.out" , "w" , stdout);
#define imod(a , n) (a % n + n ) % n
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;
#define ll long long

#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);

#define int ll

const int N =  3e5 + 3,  M = N * 4  , MX = 2e4 + 40;
const ll MOD = 998244353  , oo = 1e9 + 9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-17 ;

int di[] = {1 , -1 , 0 , 0};
int dj[] = {0 , 0 , 1 , -1};





 int32_t main()
{
    // inF;
   // inF;outF;
    fastio;

    //Welcome back without <TAWJIHI>



    int n ;
    cin >> n ;

    vector<pair<int , int > > v ;

    for(int i = 0 ; i < n + 1 ; i ++){
        int a ;
        cin >> a ;
        v.push_back({a , i});


    }

    sort(v.begin() , v.end());

    vector<int> b (n);

    for(auto &it : b)cin >> it ;

    sort(b.begin() , b.end());


    int suff[n + 1] = {};


    for(int i = n - 1 ; ~i ; i --){

        suff[i] = max(suff[i + 1] , v[i + 1].first - b[i]);


    }

    int mx = 0 ;

    int ans[n + 1] = {};

    for(int i = 0 ; i < n + 1; i ++ ){

        ans[v[i].second] = max(mx , suff[i]);

        mx = max(mx , v[i].first - b[i]);


    }

    for(int i = 0 ; i < n + 1 ; i ++)cout << ans[i] << " " ;


}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 372 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 388 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 1 ms 408 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 328 KB Output is correct
33 Correct 82 ms 12968 KB Output is correct
34 Correct 92 ms 13408 KB Output is correct
35 Correct 86 ms 13024 KB Output is correct
36 Correct 84 ms 13476 KB Output is correct
37 Correct 94 ms 13932 KB Output is correct
38 Correct 94 ms 13756 KB Output is correct
39 Correct 82 ms 12800 KB Output is correct
40 Correct 90 ms 12664 KB Output is correct
41 Correct 105 ms 12856 KB Output is correct
42 Correct 83 ms 12856 KB Output is correct
43 Correct 82 ms 12672 KB Output is correct
44 Correct 88 ms 12328 KB Output is correct
45 Correct 96 ms 12364 KB Output is correct
46 Correct 88 ms 12244 KB Output is correct
47 Correct 94 ms 12524 KB Output is correct
48 Correct 87 ms 12520 KB Output is correct
49 Correct 90 ms 13144 KB Output is correct
50 Correct 96 ms 13164 KB Output is correct
51 Correct 86 ms 13120 KB Output is correct
52 Correct 90 ms 13192 KB Output is correct
53 Correct 90 ms 13104 KB Output is correct