oj.uz

답안 #997063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
997063 2024-06-11T16:40:31 Z yeediot Jobs (BOI24_jobs) C++17
100 / 100
 165 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();
        }
    }
        int mn = min(0LL,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 140 ms 24024 KB Output is correct
2 Correct 113 ms 25256 KB Output is correct
3 Correct 82 ms 23932 KB Output is correct
4 Correct 84 ms 33884 KB Output is correct
5 Correct 71 ms 37968 KB Output is correct
6 Correct 69 ms 18900 KB Output is correct
7 Correct 131 ms 25932 KB Output is correct
8 Correct 86 ms 24608 KB Output is correct
9 Correct 78 ms 38856 KB Output is correct
10 Correct 84 ms 38480 KB Output is correct
11 Correct 142 ms 26456 KB Output is correct
12 Correct 115 ms 22328 KB Output is correct
13 Correct 143 ms 23104 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 2 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 3 ms 12380 KB Output is correct
12 Correct 2 ms 12380 KB Output is correct
13 Correct 3 ms 12376 KB Output is correct
14 Correct 2 ms 12376 KB Output is correct
15 Correct 2 ms 12380 KB Output is correct
16 Correct 2 ms 12380 KB Output is correct
17 Correct 3 ms 12380 KB Output is correct
18 Correct 3 ms 12380 KB Output is correct
19 Correct 2 ms 12308 KB Output is correct
20 Correct 2 ms 12376 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 12532 KB Output is correct
25 Correct 2 ms 12376 KB Output is correct
26 Correct 2 ms 12380 KB Output is correct
27 Correct 2 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 2 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 3 ms 12380 KB Output is correct
12 Correct 2 ms 12380 KB Output is correct
13 Correct 3 ms 12376 KB Output is correct
14 Correct 2 ms 12376 KB Output is correct
15 Correct 2 ms 12380 KB Output is correct
16 Correct 2 ms 12380 KB Output is correct
17 Correct 3 ms 12380 KB Output is correct
18 Correct 3 ms 12380 KB Output is correct
19 Correct 2 ms 12308 KB Output is correct
20 Correct 2 ms 12376 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 12532 KB Output is correct
25 Correct 2 ms 12376 KB Output is correct
26 Correct 2 ms 12380 KB Output is correct
27 Correct 2 ms 12380 KB Output is correct
28 Correct 2 ms 12380 KB Output is correct
29 Correct 77 ms 26052 KB Output is correct
30 Correct 75 ms 27168 KB Output is correct
31 Correct 63 ms 23968 KB Output is correct
32 Correct 84 ms 59216 KB Output is correct
33 Correct 96 ms 43296 KB Output is correct
34 Correct 74 ms 36956 KB Output is correct
35 Correct 40 ms 18932 KB Output is correct
36 Correct 69 ms 29000 KB Output is correct
37 Correct 78 ms 27160 KB Output is correct
38 Correct 78 ms 59040 KB Output is correct
39 Correct 77 ms 46364 KB Output is correct
40 Correct 97 ms 30524 KB Output is correct
41 Correct 72 ms 24584 KB Output is correct
42 Correct 34 ms 23760 KB Output is correct
43 Correct 76 ms 35524 KB Output is correct
44 Correct 87 ms 58452 KB Output is correct
45 Correct 88 ms 44876 KB Output is correct
46 Correct 77 ms 36724 KB Output is correct
47 Correct 77 ms 24480 KB Output is correct
48 Correct 74 ms 24128 KB Output is correct
49 Correct 78 ms 26312 KB Output is correct
50 Correct 85 ms 58448 KB Output is correct
51 Correct 57 ms 37460 KB Output is correct
52 Correct 70 ms 30840 KB Output is correct
53 Correct 48 ms 29900 KB Output is correct
54 Correct 76 ms 24128 KB Output is correct
55 Correct 75 ms 27080 KB Output is correct
56 Correct 74 ms 58448 KB Output is correct
57 Correct 89 ms 41288 KB Output is correct
58 Correct 73 ms 30808 KB Output is correct
59 Correct 82 ms 30388 KB Output is correct
60 Correct 52 ms 24640 KB Output is correct
61 Correct 77 ms 35536 KB Output is correct
62 Correct 107 ms 35744 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 2 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 3 ms 12380 KB Output is correct
12 Correct 2 ms 12380 KB Output is correct
13 Correct 3 ms 12376 KB Output is correct
14 Correct 2 ms 12376 KB Output is correct
15 Correct 2 ms 12380 KB Output is correct
16 Correct 2 ms 12380 KB Output is correct
17 Correct 3 ms 12380 KB Output is correct
18 Correct 3 ms 12380 KB Output is correct
19 Correct 2 ms 12308 KB Output is correct
20 Correct 2 ms 12376 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 12532 KB Output is correct
25 Correct 2 ms 12376 KB Output is correct
26 Correct 2 ms 12380 KB Output is correct
27 Correct 2 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 12368 KB Output is correct
31 Correct 4 ms 12380 KB Output is correct
32 Correct 2 ms 12380 KB Output is correct
33 Correct 2 ms 12376 KB Output is correct
34 Correct 3 ms 12480 KB Output is correct
35 Correct 2 ms 12376 KB Output is correct
36 Correct 2 ms 12380 KB Output is correct
37 Correct 3 ms 12380 KB Output is correct
38 Correct 3 ms 12380 KB Output is correct
39 Correct 2 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 2 ms 12380 KB Output is correct
43 Correct 2 ms 12380 KB Output is correct
44 Correct 2 ms 12380 KB Output is correct
45 Correct 2 ms 12376 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 2 ms 12384 KB Output is correct
50 Correct 2 ms 12380 KB Output is correct
51 Correct 2 ms 12380 KB Output is correct
52 Correct 2 ms 12380 KB Output is correct
53 Correct 3 ms 12408 KB Output is correct
54 Correct 3 ms 12380 KB Output is correct

Subtask #5
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 24024 KB Output is correct
2 Correct 113 ms 25256 KB Output is correct
3 Correct 82 ms 23932 KB Output is correct
4 Correct 84 ms 33884 KB Output is correct
5 Correct 71 ms 37968 KB Output is correct
6 Correct 69 ms 18900 KB Output is correct
7 Correct 131 ms 25932 KB Output is correct
8 Correct 86 ms 24608 KB Output is correct
9 Correct 78 ms 38856 KB Output is correct
10 Correct 84 ms 38480 KB Output is correct
11 Correct 142 ms 26456 KB Output is correct
12 Correct 115 ms 22328 KB Output is correct
13 Correct 143 ms 23104 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 2 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 3 ms 12380 KB Output is correct
25 Correct 2 ms 12380 KB Output is correct
26 Correct 3 ms 12376 KB Output is correct
27 Correct 2 ms 12376 KB Output is correct
28 Correct 2 ms 12380 KB Output is correct
29 Correct 2 ms 12380 KB Output is correct
30 Correct 3 ms 12380 KB Output is correct
31 Correct 3 ms 12380 KB Output is correct
32 Correct 2 ms 12308 KB Output is correct
33 Correct 2 ms 12376 KB Output is correct
34 Correct 2 ms 12380 KB Output is correct
35 Correct 2 ms 12380 KB Output is correct
36 Correct 2 ms 12380 KB Output is correct
37 Correct 2 ms 12532 KB Output is correct
38 Correct 2 ms 12376 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 77 ms 26052 KB Output is correct
43 Correct 75 ms 27168 KB Output is correct
44 Correct 63 ms 23968 KB Output is correct
45 Correct 84 ms 59216 KB Output is correct
46 Correct 96 ms 43296 KB Output is correct
47 Correct 74 ms 36956 KB Output is correct
48 Correct 40 ms 18932 KB Output is correct
49 Correct 69 ms 29000 KB Output is correct
50 Correct 78 ms 27160 KB Output is correct
51 Correct 78 ms 59040 KB Output is correct
52 Correct 77 ms 46364 KB Output is correct
53 Correct 97 ms 30524 KB Output is correct
54 Correct 72 ms 24584 KB Output is correct
55 Correct 34 ms 23760 KB Output is correct
56 Correct 76 ms 35524 KB Output is correct
57 Correct 87 ms 58452 KB Output is correct
58 Correct 88 ms 44876 KB Output is correct
59 Correct 77 ms 36724 KB Output is correct
60 Correct 77 ms 24480 KB Output is correct
61 Correct 74 ms 24128 KB Output is correct
62 Correct 78 ms 26312 KB Output is correct
63 Correct 85 ms 58448 KB Output is correct
64 Correct 57 ms 37460 KB Output is correct
65 Correct 70 ms 30840 KB Output is correct
66 Correct 48 ms 29900 KB Output is correct
67 Correct 76 ms 24128 KB Output is correct
68 Correct 75 ms 27080 KB Output is correct
69 Correct 74 ms 58448 KB Output is correct
70 Correct 89 ms 41288 KB Output is correct
71 Correct 73 ms 30808 KB Output is correct
72 Correct 82 ms 30388 KB Output is correct
73 Correct 52 ms 24640 KB Output is correct
74 Correct 77 ms 35536 KB Output is correct
75 Correct 107 ms 35744 KB Output is correct
76 Correct 2 ms 12124 KB Output is correct
77 Correct 3 ms 12368 KB Output is correct
78 Correct 4 ms 12380 KB Output is correct
79 Correct 2 ms 12380 KB Output is correct
80 Correct 2 ms 12376 KB Output is correct
81 Correct 3 ms 12480 KB Output is correct
82 Correct 2 ms 12376 KB Output is correct
83 Correct 2 ms 12380 KB Output is correct
84 Correct 3 ms 12380 KB Output is correct
85 Correct 3 ms 12380 KB Output is correct
86 Correct 2 ms 12380 KB Output is correct
87 Correct 3 ms 12380 KB Output is correct
88 Correct 2 ms 12380 KB Output is correct
89 Correct 2 ms 12380 KB Output is correct
90 Correct 2 ms 12380 KB Output is correct
91 Correct 2 ms 12380 KB Output is correct
92 Correct 2 ms 12376 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 2 ms 12384 KB Output is correct
97 Correct 2 ms 12380 KB Output is correct
98 Correct 2 ms 12380 KB Output is correct
99 Correct 2 ms 12380 KB Output is correct
100 Correct 3 ms 12408 KB Output is correct
101 Correct 3 ms 12380 KB Output is correct
102 Correct 151 ms 25084 KB Output is correct
103 Correct 106 ms 24224 KB Output is correct
104 Correct 95 ms 21316 KB Output is correct
105 Correct 76 ms 23420 KB Output is correct
106 Correct 81 ms 41236 KB Output is correct
107 Correct 64 ms 32852 KB Output is correct
108 Correct 135 ms 24352 KB Output is correct
109 Correct 50 ms 17656 KB Output is correct
110 Correct 115 ms 21532 KB Output is correct
111 Correct 89 ms 22420 KB Output is correct
112 Correct 84 ms 21312 KB Output is correct
113 Correct 78 ms 34712 KB Output is correct
114 Correct 73 ms 39248 KB Output is correct
115 Correct 57 ms 17476 KB Output is correct
116 Correct 144 ms 25348 KB Output is correct
117 Correct 100 ms 21988 KB Output is correct
118 Correct 133 ms 21604 KB Output is correct
119 Correct 84 ms 21032 KB Output is correct
120 Correct 81 ms 33740 KB Output is correct
121 Correct 72 ms 32084 KB Output is correct
122 Correct 140 ms 26532 KB Output is correct
123 Correct 136 ms 24940 KB Output is correct
124 Correct 96 ms 21328 KB Output is correct
125 Correct 133 ms 21948 KB Output is correct
126 Correct 84 ms 24576 KB Output is correct
127 Correct 47 ms 22260 KB Output is correct
128 Correct 33 ms 22356 KB Output is correct
129 Correct 158 ms 27208 KB Output is correct
130 Correct 122 ms 25284 KB Output is correct
131 Correct 109 ms 23936 KB Output is correct
132 Correct 87 ms 21516 KB Output is correct
133 Correct 77 ms 25156 KB Output is correct
134 Correct 82 ms 42444 KB Output is correct
135 Correct 66 ms 36436 KB Output is correct
136 Correct 144 ms 27736 KB Output is correct
137 Correct 165 ms 27368 KB Output is correct