oj.uz

답안 #213249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
213249 2020-03-25T11:16:33 Z DodgeBallMan 별자리 3 (JOI20_constellation3) C++14
100 / 100
 523 ms 39416 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 2e5 + 10;

vector<int> peak[N];
int par[N], l[N], r[N], chk[N], n, k;
long long seg[4*N], lz[4*N], sum;
vector<pii> starx[N], stary[N];

int find( int x ) { return x == par[x] ? x : par[x] = find( par[x] ); }

void merge( int a, int b ) {
    a = find( a ), b = find( b );
    if( a == b ) return ;
    par[b] = a, l[a] = min( l[a], l[b] ), r[a] = max( r[a], r[b] );
}

void push( int l, int r, int idx ) {
    if( lz[idx] != 0 ) {
        seg[idx] += lz[idx];
        if( l != r ) lz[idx<<1] += lz[idx], lz[idx<<1|1] += lz[idx];
        lz[idx] = 0;
    }
}

void update( int ll, int rr, long long va, int l = 1, int r = n, int idx = 1 ) {
    push( l, r, idx );
    if( l > rr || r < ll ) return ;
    if( l >= ll && r <= rr ) {
        lz[idx] += va, push( l, r, idx );
        return ;
    }
    int mid = l + r >> 1;
    update( ll, rr, va, l, mid, idx<<1 ), update( ll, rr, va, mid+1, r, idx<<1|1 );
    seg[idx] = max( seg[idx<<1], seg[idx<<1|1] );
}

long long query( int ll, int rr, int l = 1, int r = n, int idx = 1 ) {
    push( l, r, idx );
    if( l > rr || r < ll ) return -1e9;
    if( l >= ll && r <= rr ) return seg[idx];
    int mid = l + r >> 1;
    return max( query( ll, rr, l, mid, idx<<1 ), query( ll, rr, mid+1, r, idx<<1|1 ) );
}

int main()
{
    iota( par, par+N, 0 ), iota( l, l+N, 0 ), iota( r, r+N, 0 );
    scanf("%d",&n);
    for( int i = 1, temp ; i <= n ; i++ ) {
        scanf("%d",&temp);
        peak[temp+1].emplace_back( i );
    }
    scanf("%d",&k);
    for( int i = 1, x, y, c ; i <= k ; i++ ) {
        scanf("%d %d %d",&x,&y,&c);
        sum += ( long long )c;
        starx[x].emplace_back( y, c );
    }
    for( int i = 1 ; i <= n ; i++ ) if( !starx[i].empty() ){
        sort( starx[i].begin(), starx[i].end() );
        int now = 0;
        for( pii t : starx[i] ) if( t.y > now ) {
            stary[t.x].emplace_back( i, t.y - now );
            now = t.y;
        }
    }
    for( int i = 1 ; i <= n+1 ; i++ ) {
        for( int x : peak[i] ) {
            //printf("%d %d\n",i,x);
            long long val = 0, var = 0;
            int parl = find( x-1 ), parr = find( x+1 );
            if( x > 1 && chk[x-1] ) val += query( l[parl], r[parl] );
            if( x < n && chk[x+1] ) var += query( l[parr], r[parr] );
            if( x > 1 && chk[x-1] ) update( l[parl], r[parl], var );
            if( x < n && chk[x+1] ) update( l[parr], r[parr], val );
            update( x, x, val + var );
            if( x > 1 && chk[x - 1] ) merge( x - 1, x );
            if( x < n && chk[x + 1] ) merge( x, x + 1 );
            chk[x] = 1;
        }
        for( pii x : stary[i] ) update( x.x, x.x, ( long long )x.y );
    }
    printf("%lld",sum-seg[1]);
    return 0;
}

Compilation message

constellation3.cpp: In function 'void update(int, int, long long int, int, int, int)':
constellation3.cpp:38:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = l + r >> 1;
               ~~^~~
constellation3.cpp: In function 'long long int query(int, int, int, int, int)':
constellation3.cpp:47:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = l + r >> 1;
               ~~^~~
constellation3.cpp: In function 'int main()':
constellation3.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
constellation3.cpp:56:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&temp);
         ~~~~~^~~~~~~~~~~~
constellation3.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&k);
     ~~~~~^~~~~~~~~
constellation3.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&x,&y,&c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 16768 KB Output is correct
2 Correct 14 ms 16896 KB Output is correct
3 Correct 14 ms 17024 KB Output is correct
4 Correct 14 ms 16896 KB Output is correct
5 Correct 14 ms 16896 KB Output is correct
6 Correct 13 ms 16896 KB Output is correct
7 Correct 14 ms 16896 KB Output is correct
8 Correct 15 ms 16896 KB Output is correct
9 Correct 14 ms 16896 KB Output is correct
10 Correct 14 ms 16896 KB Output is correct
11 Correct 14 ms 16896 KB Output is correct
12 Correct 14 ms 16896 KB Output is correct
13 Correct 15 ms 16896 KB Output is correct
14 Correct 14 ms 16896 KB Output is correct
15 Correct 14 ms 16768 KB Output is correct
16 Correct 14 ms 16896 KB Output is correct
17 Correct 14 ms 16896 KB Output is correct
18 Correct 14 ms 16896 KB Output is correct
19 Correct 14 ms 17024 KB Output is correct
20 Correct 14 ms 16896 KB Output is correct
21 Correct 14 ms 16896 KB Output is correct
22 Correct 15 ms 16896 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 16768 KB Output is correct
2 Correct 14 ms 16896 KB Output is correct
3 Correct 14 ms 17024 KB Output is correct
4 Correct 14 ms 16896 KB Output is correct
5 Correct 14 ms 16896 KB Output is correct
6 Correct 13 ms 16896 KB Output is correct
7 Correct 14 ms 16896 KB Output is correct
8 Correct 15 ms 16896 KB Output is correct
9 Correct 14 ms 16896 KB Output is correct
10 Correct 14 ms 16896 KB Output is correct
11 Correct 14 ms 16896 KB Output is correct
12 Correct 14 ms 16896 KB Output is correct
13 Correct 15 ms 16896 KB Output is correct
14 Correct 14 ms 16896 KB Output is correct
15 Correct 14 ms 16768 KB Output is correct
16 Correct 14 ms 16896 KB Output is correct
17 Correct 14 ms 16896 KB Output is correct
18 Correct 14 ms 16896 KB Output is correct
19 Correct 14 ms 17024 KB Output is correct
20 Correct 14 ms 16896 KB Output is correct
21 Correct 14 ms 16896 KB Output is correct
22 Correct 15 ms 16896 KB Output is correct
23 Correct 16 ms 17024 KB Output is correct
24 Correct 16 ms 17024 KB Output is correct
25 Correct 17 ms 17024 KB Output is correct
26 Correct 17 ms 17024 KB Output is correct
27 Correct 17 ms 17024 KB Output is correct
28 Correct 16 ms 17024 KB Output is correct
29 Correct 17 ms 17024 KB Output is correct
30 Correct 17 ms 17024 KB Output is correct
31 Correct 16 ms 17024 KB Output is correct
32 Correct 19 ms 17024 KB Output is correct
33 Correct 17 ms 17024 KB Output is correct
34 Correct 17 ms 17024 KB Output is correct
35 Correct 16 ms 17024 KB Output is correct
36 Correct 16 ms 16896 KB Output is correct
37 Correct 16 ms 17024 KB Output is correct
38 Correct 16 ms 17024 KB Output is correct
39 Correct 17 ms 16896 KB Output is correct
40 Correct 17 ms 17024 KB Output is correct
41 Correct 16 ms 16896 KB Output is correct
42 Correct 16 ms 16896 KB Output is correct
43 Correct 16 ms 17024 KB Output is correct
44 Correct 17 ms 17024 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 16768 KB Output is correct
2 Correct 14 ms 16896 KB Output is correct
3 Correct 14 ms 17024 KB Output is correct
4 Correct 14 ms 16896 KB Output is correct
5 Correct 14 ms 16896 KB Output is correct
6 Correct 13 ms 16896 KB Output is correct
7 Correct 14 ms 16896 KB Output is correct
8 Correct 15 ms 16896 KB Output is correct
9 Correct 14 ms 16896 KB Output is correct
10 Correct 14 ms 16896 KB Output is correct
11 Correct 14 ms 16896 KB Output is correct
12 Correct 14 ms 16896 KB Output is correct
13 Correct 15 ms 16896 KB Output is correct
14 Correct 14 ms 16896 KB Output is correct
15 Correct 14 ms 16768 KB Output is correct
16 Correct 14 ms 16896 KB Output is correct
17 Correct 14 ms 16896 KB Output is correct
18 Correct 14 ms 16896 KB Output is correct
19 Correct 14 ms 17024 KB Output is correct
20 Correct 14 ms 16896 KB Output is correct
21 Correct 14 ms 16896 KB Output is correct
22 Correct 15 ms 16896 KB Output is correct
23 Correct 16 ms 17024 KB Output is correct
24 Correct 16 ms 17024 KB Output is correct
25 Correct 17 ms 17024 KB Output is correct
26 Correct 17 ms 17024 KB Output is correct
27 Correct 17 ms 17024 KB Output is correct
28 Correct 16 ms 17024 KB Output is correct
29 Correct 17 ms 17024 KB Output is correct
30 Correct 17 ms 17024 KB Output is correct
31 Correct 16 ms 17024 KB Output is correct
32 Correct 19 ms 17024 KB Output is correct
33 Correct 17 ms 17024 KB Output is correct
34 Correct 17 ms 17024 KB Output is correct
35 Correct 16 ms 17024 KB Output is correct
36 Correct 16 ms 16896 KB Output is correct
37 Correct 16 ms 17024 KB Output is correct
38 Correct 16 ms 17024 KB Output is correct
39 Correct 17 ms 16896 KB Output is correct
40 Correct 17 ms 17024 KB Output is correct
41 Correct 16 ms 16896 KB Output is correct
42 Correct 16 ms 16896 KB Output is correct
43 Correct 16 ms 17024 KB Output is correct
44 Correct 17 ms 17024 KB Output is correct
45 Correct 516 ms 37112 KB Output is correct
46 Correct 510 ms 36860 KB Output is correct
47 Correct 520 ms 36984 KB Output is correct
48 Correct 518 ms 36984 KB Output is correct
49 Correct 497 ms 36728 KB Output is correct
50 Correct 501 ms 36728 KB Output is correct
51 Correct 498 ms 36856 KB Output is correct
52 Correct 523 ms 36984 KB Output is correct
53 Correct 511 ms 36856 KB Output is correct
54 Correct 437 ms 39416 KB Output is correct
55 Correct 457 ms 39160 KB Output is correct
56 Correct 433 ms 39032 KB Output is correct
57 Correct 435 ms 39032 KB Output is correct
58 Correct 399 ms 33912 KB Output is correct
59 Correct 423 ms 33912 KB Output is correct
60 Correct 301 ms 38264 KB Output is correct
61 Correct 376 ms 33272 KB Output is correct
62 Correct 448 ms 37368 KB Output is correct
63 Correct 352 ms 33132 KB Output is correct
64 Correct 348 ms 33016 KB Output is correct
65 Correct 448 ms 37240 KB Output is correct
66 Correct 371 ms 33012 KB Output is correct