oj.uz

답안 #997060

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
997060 2024-06-11T16:30:13 Z yeediot Jobs (BOI24_jobs) C++17
100 / 100
 208 ms 59216 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 3e5+5;
vector<int>adj[mxn];
int p[mxn], val[mxn];
bool vis[mxn];
#define pqpii priority_queue<pii>
pqpii dfs(int v){
    pqpii pq;
    for(auto u : adj[v]){
        auto pq2 = dfs(u);
        if(sz(pq2) > sz(pq))swap(pq, pq2);
        while(sz(pq2)){
            pq.push(pq2.top());
            pq2.pop();
        }
    }
    if(val[v] > 0){
        pq.push({0, val[v]});
    }
    else{
        int mn = val[v], sum = val[v];
        while(sz(pq) and sum<=0){
            auto [mn2, sum2] = pq.top();
            pq.pop();
            mn = min(mn, sum+mn2);
            sum += sum2;
        }
        while(sz(pq)){
            auto [mn2, sum2] = pq.top();
            if(sum + mn2 < mn){
                break;
            }
            pq.pop();
            sum += sum2;
        }
        if(sum > 0){
            pq.push({mn, sum});
        }
    }
    return pq;
}
signed main(){
    TOI_is_so_de;
    int n, s, ans = 0;
    cin >> n >> s;
    val[0] = s;
    for(int i=1;i<=n;i++){
        cin >> val[i] >> p[i];
        adj[p[i]].pb(i);
    }
    auto pq = dfs(0);
    while(sz(pq)){
        auto [mn, sum] = pq.top();
        pq.pop();
        if(ans + mn >= 0) ans += sum;
        else break;
    }
    cout << ans-val[0] << '\n';
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
     function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
         std::ifstream file1(p1);
         std::ifstream file2(p2);
         if (!file1.is_open() || !file2.is_open())return false;
         std::string line1, line2;
         while (getline(file1, line1) && getline(file2, line2)) {
             if (line1 != line2)return false;
         }
         int cnta=0,cntb=0;
         while(getline(file1,line1))cnta++;
         while(getline(file2,line2))cntb++;
         return cntb-cnta<=1;
     };
     bool check = compareFiles("output.txt","expected.txt");
     if (check) cerr<<"ACCEPTED\n";
     else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

Compilation message

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 24008 KB Output is correct
2 Correct 104 ms 24676 KB Output is correct
3 Correct 82 ms 23672 KB Output is correct
4 Correct 88 ms 34100 KB Output is correct
5 Correct 73 ms 37976 KB Output is correct
6 Correct 87 ms 19004 KB Output is correct
7 Correct 118 ms 25488 KB Output is correct
8 Correct 83 ms 23676 KB Output is correct
9 Correct 75 ms 38860 KB Output is correct
10 Correct 66 ms 38484 KB Output is correct
11 Correct 150 ms 26064 KB Output is correct
12 Correct 115 ms 22340 KB Output is correct
13 Correct 144 ms 23180 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12124 KB Output is correct
2 Correct 2 ms 12124 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 3 ms 12380 KB Output is correct
5 Correct 2 ms 12380 KB Output is correct
6 Correct 3 ms 12380 KB Output is correct
7 Correct 3 ms 12380 KB Output is correct
8 Correct 2 ms 12380 KB Output is correct
9 Correct 2 ms 12380 KB Output is correct
10 Correct 2 ms 12380 KB Output is correct
11 Correct 2 ms 12380 KB Output is correct
12 Correct 3 ms 12380 KB Output is correct
13 Correct 2 ms 12380 KB Output is correct
14 Correct 3 ms 12380 KB Output is correct
15 Correct 2 ms 12380 KB Output is correct
16 Correct 3 ms 12368 KB Output is correct
17 Correct 3 ms 12380 KB Output is correct
18 Correct 3 ms 12352 KB Output is correct
19 Correct 3 ms 12380 KB Output is correct
20 Correct 2 ms 12420 KB Output is correct
21 Correct 2 ms 12196 KB Output is correct
22 Correct 3 ms 12380 KB Output is correct
23 Correct 2 ms 12380 KB Output is correct
24 Correct 2 ms 12380 KB Output is correct
25 Correct 3 ms 12380 KB Output is correct
26 Correct 3 ms 12380 KB Output is correct
27 Correct 3 ms 12380 KB Output is correct
28 Correct 2 ms 12380 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12124 KB Output is correct
2 Correct 2 ms 12124 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 3 ms 12380 KB Output is correct
5 Correct 2 ms 12380 KB Output is correct
6 Correct 3 ms 12380 KB Output is correct
7 Correct 3 ms 12380 KB Output is correct
8 Correct 2 ms 12380 KB Output is correct
9 Correct 2 ms 12380 KB Output is correct
10 Correct 2 ms 12380 KB Output is correct
11 Correct 2 ms 12380 KB Output is correct
12 Correct 3 ms 12380 KB Output is correct
13 Correct 2 ms 12380 KB Output is correct
14 Correct 3 ms 12380 KB Output is correct
15 Correct 2 ms 12380 KB Output is correct
16 Correct 3 ms 12368 KB Output is correct
17 Correct 3 ms 12380 KB Output is correct
18 Correct 3 ms 12352 KB Output is correct
19 Correct 3 ms 12380 KB Output is correct
20 Correct 2 ms 12420 KB Output is correct
21 Correct 2 ms 12196 KB Output is correct
22 Correct 3 ms 12380 KB Output is correct
23 Correct 2 ms 12380 KB Output is correct
24 Correct 2 ms 12380 KB Output is correct
25 Correct 3 ms 12380 KB Output is correct
26 Correct 3 ms 12380 KB Output is correct
27 Correct 3 ms 12380 KB Output is correct
28 Correct 2 ms 12380 KB Output is correct
29 Correct 78 ms 27588 KB Output is correct
30 Correct 69 ms 27240 KB Output is correct
31 Correct 66 ms 22848 KB Output is correct
32 Correct 72 ms 59216 KB Output is correct
33 Correct 79 ms 43384 KB Output is correct
34 Correct 75 ms 37004 KB Output is correct
35 Correct 40 ms 18848 KB Output is correct
36 Correct 97 ms 29000 KB Output is correct
37 Correct 84 ms 26792 KB Output is correct
38 Correct 77 ms 59216 KB Output is correct
39 Correct 106 ms 46160 KB Output is correct
40 Correct 76 ms 30524 KB Output is correct
41 Correct 65 ms 24580 KB Output is correct
42 Correct 32 ms 23744 KB Output is correct
43 Correct 73 ms 35408 KB Output is correct
44 Correct 86 ms 58444 KB Output is correct
45 Correct 87 ms 45116 KB Output is correct
46 Correct 76 ms 36772 KB Output is correct
47 Correct 80 ms 24476 KB Output is correct
48 Correct 73 ms 24424 KB Output is correct
49 Correct 76 ms 27044 KB Output is correct
50 Correct 83 ms 58448 KB Output is correct
51 Correct 76 ms 37460 KB Output is correct
52 Correct 71 ms 30688 KB Output is correct
53 Correct 53 ms 29772 KB Output is correct
54 Correct 70 ms 23620 KB Output is correct
55 Correct 77 ms 27592 KB Output is correct
56 Correct 86 ms 58452 KB Output is correct
57 Correct 80 ms 41260 KB Output is correct
58 Correct 78 ms 30848 KB Output is correct
59 Correct 80 ms 30576 KB Output is correct
60 Correct 54 ms 24052 KB Output is correct
61 Correct 75 ms 35416 KB Output is correct
62 Correct 91 ms 34212 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12124 KB Output is correct
2 Correct 2 ms 12124 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 3 ms 12380 KB Output is correct
5 Correct 2 ms 12380 KB Output is correct
6 Correct 3 ms 12380 KB Output is correct
7 Correct 3 ms 12380 KB Output is correct
8 Correct 2 ms 12380 KB Output is correct
9 Correct 2 ms 12380 KB Output is correct
10 Correct 2 ms 12380 KB Output is correct
11 Correct 2 ms 12380 KB Output is correct
12 Correct 3 ms 12380 KB Output is correct
13 Correct 2 ms 12380 KB Output is correct
14 Correct 3 ms 12380 KB Output is correct
15 Correct 2 ms 12380 KB Output is correct
16 Correct 3 ms 12368 KB Output is correct
17 Correct 3 ms 12380 KB Output is correct
18 Correct 3 ms 12352 KB Output is correct
19 Correct 3 ms 12380 KB Output is correct
20 Correct 2 ms 12420 KB Output is correct
21 Correct 2 ms 12196 KB Output is correct
22 Correct 3 ms 12380 KB Output is correct
23 Correct 2 ms 12380 KB Output is correct
24 Correct 2 ms 12380 KB Output is correct
25 Correct 3 ms 12380 KB Output is correct
26 Correct 3 ms 12380 KB Output is correct
27 Correct 3 ms 12380 KB Output is correct
28 Correct 2 ms 12380 KB Output is correct
29 Correct 2 ms 12124 KB Output is correct
30 Correct 3 ms 12376 KB Output is correct
31 Correct 2 ms 12380 KB Output is correct
32 Correct 2 ms 12380 KB Output is correct
33 Correct 2 ms 12380 KB Output is correct
34 Correct 3 ms 12380 KB Output is correct
35 Correct 2 ms 12380 KB Output is correct
36 Correct 3 ms 12368 KB Output is correct
37 Correct 3 ms 12408 KB Output is correct
38 Correct 2 ms 12220 KB Output is correct
39 Correct 2 ms 12380 KB Output is correct
40 Correct 2 ms 12380 KB Output is correct
41 Correct 2 ms 12380 KB Output is correct
42 Correct 3 ms 12400 KB Output is correct
43 Correct 3 ms 12376 KB Output is correct
44 Correct 2 ms 12380 KB Output is correct
45 Correct 2 ms 12380 KB Output is correct
46 Correct 2 ms 12380 KB Output is correct
47 Correct 2 ms 12380 KB Output is correct
48 Correct 3 ms 12380 KB Output is correct
49 Correct 3 ms 12380 KB Output is correct
50 Correct 4 ms 12380 KB Output is correct
51 Correct 3 ms 12376 KB Output is correct
52 Correct 3 ms 12380 KB Output is correct
53 Correct 2 ms 12380 KB Output is correct
54 Correct 2 ms 12380 KB Output is correct

Subtask #5
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 24008 KB Output is correct
2 Correct 104 ms 24676 KB Output is correct
3 Correct 82 ms 23672 KB Output is correct
4 Correct 88 ms 34100 KB Output is correct
5 Correct 73 ms 37976 KB Output is correct
6 Correct 87 ms 19004 KB Output is correct
7 Correct 118 ms 25488 KB Output is correct
8 Correct 83 ms 23676 KB Output is correct
9 Correct 75 ms 38860 KB Output is correct
10 Correct 66 ms 38484 KB Output is correct
11 Correct 150 ms 26064 KB Output is correct
12 Correct 115 ms 22340 KB Output is correct
13 Correct 144 ms 23180 KB Output is correct
14 Correct 2 ms 12124 KB Output is correct
15 Correct 2 ms 12124 KB Output is correct
16 Correct 2 ms 12124 KB Output is correct
17 Correct 3 ms 12380 KB Output is correct
18 Correct 2 ms 12380 KB Output is correct
19 Correct 3 ms 12380 KB Output is correct
20 Correct 3 ms 12380 KB Output is correct
21 Correct 2 ms 12380 KB Output is correct
22 Correct 2 ms 12380 KB Output is correct
23 Correct 2 ms 12380 KB Output is correct
24 Correct 2 ms 12380 KB Output is correct
25 Correct 3 ms 12380 KB Output is correct
26 Correct 2 ms 12380 KB Output is correct
27 Correct 3 ms 12380 KB Output is correct
28 Correct 2 ms 12380 KB Output is correct
29 Correct 3 ms 12368 KB Output is correct
30 Correct 3 ms 12380 KB Output is correct
31 Correct 3 ms 12352 KB Output is correct
32 Correct 3 ms 12380 KB Output is correct
33 Correct 2 ms 12420 KB Output is correct
34 Correct 2 ms 12196 KB Output is correct
35 Correct 3 ms 12380 KB Output is correct
36 Correct 2 ms 12380 KB Output is correct
37 Correct 2 ms 12380 KB Output is correct
38 Correct 3 ms 12380 KB Output is correct
39 Correct 3 ms 12380 KB Output is correct
40 Correct 3 ms 12380 KB Output is correct
41 Correct 2 ms 12380 KB Output is correct
42 Correct 78 ms 27588 KB Output is correct
43 Correct 69 ms 27240 KB Output is correct
44 Correct 66 ms 22848 KB Output is correct
45 Correct 72 ms 59216 KB Output is correct
46 Correct 79 ms 43384 KB Output is correct
47 Correct 75 ms 37004 KB Output is correct
48 Correct 40 ms 18848 KB Output is correct
49 Correct 97 ms 29000 KB Output is correct
50 Correct 84 ms 26792 KB Output is correct
51 Correct 77 ms 59216 KB Output is correct
52 Correct 106 ms 46160 KB Output is correct
53 Correct 76 ms 30524 KB Output is correct
54 Correct 65 ms 24580 KB Output is correct
55 Correct 32 ms 23744 KB Output is correct
56 Correct 73 ms 35408 KB Output is correct
57 Correct 86 ms 58444 KB Output is correct
58 Correct 87 ms 45116 KB Output is correct
59 Correct 76 ms 36772 KB Output is correct
60 Correct 80 ms 24476 KB Output is correct
61 Correct 73 ms 24424 KB Output is correct
62 Correct 76 ms 27044 KB Output is correct
63 Correct 83 ms 58448 KB Output is correct
64 Correct 76 ms 37460 KB Output is correct
65 Correct 71 ms 30688 KB Output is correct
66 Correct 53 ms 29772 KB Output is correct
67 Correct 70 ms 23620 KB Output is correct
68 Correct 77 ms 27592 KB Output is correct
69 Correct 86 ms 58452 KB Output is correct
70 Correct 80 ms 41260 KB Output is correct
71 Correct 78 ms 30848 KB Output is correct
72 Correct 80 ms 30576 KB Output is correct
73 Correct 54 ms 24052 KB Output is correct
74 Correct 75 ms 35416 KB Output is correct
75 Correct 91 ms 34212 KB Output is correct
76 Correct 2 ms 12124 KB Output is correct
77 Correct 3 ms 12376 KB Output is correct
78 Correct 2 ms 12380 KB Output is correct
79 Correct 2 ms 12380 KB Output is correct
80 Correct 2 ms 12380 KB Output is correct
81 Correct 3 ms 12380 KB Output is correct
82 Correct 2 ms 12380 KB Output is correct
83 Correct 3 ms 12368 KB Output is correct
84 Correct 3 ms 12408 KB Output is correct
85 Correct 2 ms 12220 KB Output is correct
86 Correct 2 ms 12380 KB Output is correct
87 Correct 2 ms 12380 KB Output is correct
88 Correct 2 ms 12380 KB Output is correct
89 Correct 3 ms 12400 KB Output is correct
90 Correct 3 ms 12376 KB Output is correct
91 Correct 2 ms 12380 KB Output is correct
92 Correct 2 ms 12380 KB Output is correct
93 Correct 2 ms 12380 KB Output is correct
94 Correct 2 ms 12380 KB Output is correct
95 Correct 3 ms 12380 KB Output is correct
96 Correct 3 ms 12380 KB Output is correct
97 Correct 4 ms 12380 KB Output is correct
98 Correct 3 ms 12376 KB Output is correct
99 Correct 3 ms 12380 KB Output is correct
100 Correct 2 ms 12380 KB Output is correct
101 Correct 2 ms 12380 KB Output is correct
102 Correct 149 ms 26628 KB Output is correct
103 Correct 108 ms 25496 KB Output is correct
104 Correct 100 ms 21448 KB Output is correct
105 Correct 74 ms 24704 KB Output is correct
106 Correct 82 ms 41424 KB Output is correct
107 Correct 61 ms 32840 KB Output is correct
108 Correct 161 ms 24484 KB Output is correct
109 Correct 52 ms 17476 KB Output is correct
110 Correct 83 ms 21604 KB Output is correct
111 Correct 96 ms 22476 KB Output is correct
112 Correct 83 ms 21308 KB Output is correct
113 Correct 85 ms 34672 KB Output is correct
114 Correct 76 ms 39120 KB Output is correct
115 Correct 53 ms 17424 KB Output is correct
116 Correct 135 ms 26220 KB Output is correct
117 Correct 99 ms 21920 KB Output is correct
118 Correct 102 ms 21536 KB Output is correct
119 Correct 85 ms 21132 KB Output is correct
120 Correct 90 ms 33744 KB Output is correct
121 Correct 70 ms 32184 KB Output is correct
122 Correct 167 ms 25508 KB Output is correct
123 Correct 181 ms 25848 KB Output is correct
124 Correct 145 ms 21384 KB Output is correct
125 Correct 109 ms 21920 KB Output is correct
126 Correct 93 ms 25452 KB Output is correct
127 Correct 53 ms 22476 KB Output is correct
128 Correct 30 ms 22412 KB Output is correct
129 Correct 195 ms 26968 KB Output is correct
130 Correct 164 ms 26372 KB Output is correct
131 Correct 113 ms 25280 KB Output is correct
132 Correct 105 ms 21564 KB Output is correct
133 Correct 92 ms 23676 KB Output is correct
134 Correct 91 ms 41316 KB Output is correct
135 Correct 67 ms 36320 KB Output is correct
136 Correct 177 ms 27432 KB Output is correct
137 Correct 208 ms 28076 KB Output is correct