oj.uz

답안 #815112

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
815112 2023-08-08T12:27:38 Z 79brue Arranging Tickets (JOI17_arranging_tickets) C++17
100 / 100
 1172 ms 18460 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, k;
int ex[200002], ey[200002]; ll ew[200002];
ll arr[200002], tarr[200002];
ll lim[200002];
ll flipCnt[200002];

vector<int> toSee[200002];

struct dat{
    int r, idx; ll cnt;
    dat(){}
    dat(int r, int idx, ll cnt): r(r), idx(idx), cnt(cnt){}
    bool operator<(const dat &nxt)const{
        return r<nxt.r;
    }
};

bool able(int x, ll MX, ll flip){
    if(flip < 0) return false;
    lim[0] = MX + flip;
    for(int i=1; i<n; i++) lim[i] = MX + flip - arr[i];
    for(int i=2; i<x; i++) lim[i] = min(lim[i], lim[i-1]);
    for(int i=n-2; i>x; i--) lim[i] = min(lim[i], lim[i+1]);
    for(int i=0; i<n; i++) lim[i] /= 2;
    for(int i=0; i<n; i++) lim[i] = min(lim[i], flip);
    for(int i=1; i<=k; i++) flipCnt[i] = 0;

    priority_queue<dat> pq;
    for(int s=1; s<=x; s++){
        for(int idx: toSee[s]) if(ey[idx] >= x+1) pq.push(dat(ey[idx], idx, ew[idx]));
        if(lim[s-1] == lim[s] && s != x) continue;
        ll val = lim[s-1] - (s==x ? 0 : lim[s]);
        while(val > 0){
            if(pq.empty()) break;
            dat tmp = pq.top(); pq.pop();
            ll take = min(val, tmp.cnt);
            flipCnt[tmp.idx] += take, tmp.cnt -= take, val -= take, flip -= take;
            if(tmp.cnt) pq.push(tmp);
        }
    }
    if(flip > 0) return false;

    for(int i=1; i<=n; i++) tarr[i] = 0;
    for(int i=1; i<=k; i++){
        tarr[ex[i]] += ew[i] - flipCnt[i], tarr[ey[i]] -= ew[i] - flipCnt[i];
        tarr[1] += flipCnt[i], tarr[ex[i]] -= flipCnt[i];
        tarr[ey[i]] += flipCnt[i], tarr[n+1] -= flipCnt[i];
    }
    for(int i=1; i<=n; i++){
        tarr[i] += tarr[i-1];
        if(tarr[i] > MX) return false;
    }
    return true;
}

int main(){
    scanf("%d %d", &n, &k);
    for(int i=1; i<=k; i++){
        scanf("%d %d %lld", &ex[i], &ey[i], &ew[i]);
        if(ex[i] > ey[i]) swap(ex[i], ey[i]);
        toSee[ex[i]].push_back(i);
    }

    /// 1. 초기 구간별 합을 구해 준다
    for(int i=1; i<=k; i++) arr[ex[i]] += ew[i], arr[ey[i]] -= ew[i];
    for(int i=1; i<=n; i++) arr[i] += arr[i-1];

    int x = max_element(arr+1, arr+n) - arr; /// 최댓값 위치

    /// 2. 답에 대한 이분 탐색
    ll L = 0, R = arr[x], ANS = R;
    while(L <= R){
        ll M = (L+R)/2;
        if(able(x, M, arr[x] - M) || able(x, M, arr[x] - M + 1)) ANS = M, R = M-1;
        else L = M+1;
    }

    printf("%lld", ANS);
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
arranging_tickets.cpp:65:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |         scanf("%d %d %lld", &ex[i], &ey[i], &ew[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 5008 KB Output is correct
11 Correct 3 ms 5004 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 5004 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 5008 KB Output is correct
11 Correct 3 ms 5004 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 5004 KB Output is correct
16 Correct 2 ms 5076 KB Output is correct
17 Correct 4 ms 5012 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5040 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5008 KB Output is correct
27 Correct 3 ms 5032 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 5008 KB Output is correct
11 Correct 3 ms 5004 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 5004 KB Output is correct
16 Correct 2 ms 5076 KB Output is correct
17 Correct 4 ms 5012 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5040 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5008 KB Output is correct
27 Correct 3 ms 5032 KB Output is correct
28 Correct 6 ms 5332 KB Output is correct
29 Correct 6 ms 5332 KB Output is correct
30 Correct 7 ms 5268 KB Output is correct
31 Correct 6 ms 5204 KB Output is correct
32 Correct 5 ms 5204 KB Output is correct
33 Correct 5 ms 5332 KB Output is correct
34 Correct 7 ms 5312 KB Output is correct
35 Correct 5 ms 5204 KB Output is correct
36 Correct 5 ms 5204 KB Output is correct
37 Correct 6 ms 5204 KB Output is correct
38 Correct 5 ms 5280 KB Output is correct
39 Correct 4 ms 5272 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 5008 KB Output is correct
11 Correct 3 ms 5004 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 5004 KB Output is correct
16 Correct 2 ms 5076 KB Output is correct
17 Correct 4 ms 5012 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5040 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5008 KB Output is correct
27 Correct 3 ms 5032 KB Output is correct
28 Correct 6 ms 5332 KB Output is correct
29 Correct 6 ms 5332 KB Output is correct
30 Correct 7 ms 5268 KB Output is correct
31 Correct 6 ms 5204 KB Output is correct
32 Correct 5 ms 5204 KB Output is correct
33 Correct 5 ms 5332 KB Output is correct
34 Correct 7 ms 5312 KB Output is correct
35 Correct 5 ms 5204 KB Output is correct
36 Correct 5 ms 5204 KB Output is correct
37 Correct 6 ms 5204 KB Output is correct
38 Correct 5 ms 5280 KB Output is correct
39 Correct 4 ms 5272 KB Output is correct
40 Correct 225 ms 17440 KB Output is correct
41 Correct 210 ms 17688 KB Output is correct
42 Correct 200 ms 17188 KB Output is correct
43 Correct 224 ms 17216 KB Output is correct
44 Correct 296 ms 17384 KB Output is correct
45 Correct 286 ms 16900 KB Output is correct
46 Correct 200 ms 16984 KB Output is correct
47 Correct 387 ms 16892 KB Output is correct
48 Correct 308 ms 16472 KB Output is correct
49 Correct 215 ms 14688 KB Output is correct
50 Correct 66 ms 14224 KB Output is correct
51 Correct 157 ms 14272 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 5008 KB Output is correct
11 Correct 3 ms 5004 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 5004 KB Output is correct
16 Correct 2 ms 5076 KB Output is correct
17 Correct 4 ms 5012 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5040 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5008 KB Output is correct
27 Correct 3 ms 5032 KB Output is correct
28 Correct 6 ms 5332 KB Output is correct
29 Correct 6 ms 5332 KB Output is correct
30 Correct 7 ms 5268 KB Output is correct
31 Correct 6 ms 5204 KB Output is correct
32 Correct 5 ms 5204 KB Output is correct
33 Correct 5 ms 5332 KB Output is correct
34 Correct 7 ms 5312 KB Output is correct
35 Correct 5 ms 5204 KB Output is correct
36 Correct 5 ms 5204 KB Output is correct
37 Correct 6 ms 5204 KB Output is correct
38 Correct 5 ms 5280 KB Output is correct
39 Correct 4 ms 5272 KB Output is correct
40 Correct 225 ms 17440 KB Output is correct
41 Correct 210 ms 17688 KB Output is correct
42 Correct 200 ms 17188 KB Output is correct
43 Correct 224 ms 17216 KB Output is correct
44 Correct 296 ms 17384 KB Output is correct
45 Correct 286 ms 16900 KB Output is correct
46 Correct 200 ms 16984 KB Output is correct
47 Correct 387 ms 16892 KB Output is correct
48 Correct 308 ms 16472 KB Output is correct
49 Correct 215 ms 14688 KB Output is correct
50 Correct 66 ms 14224 KB Output is correct
51 Correct 157 ms 14272 KB Output is correct
52 Correct 1096 ms 18460 KB Output is correct
53 Correct 704 ms 17956 KB Output is correct
54 Correct 1092 ms 18380 KB Output is correct
55 Correct 1172 ms 18216 KB Output is correct
56 Correct 897 ms 17848 KB Output is correct
57 Correct 1039 ms 17692 KB Output is correct
58 Correct 895 ms 17804 KB Output is correct
59 Correct 711 ms 15324 KB Output is correct