oj.uz

Submission #997062

# Submission time Handle Problem Language Result Execution time Memory
997062 2024-06-11T16:37:31 Z yeediot Jobs (BOI24_jobs) C++17
40 / 100
 141 ms 59708 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;
        }
        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

# Verdict Execution time Memory Grader output
1 Correct 134 ms 24016 KB Output is correct
2 Correct 121 ms 24924 KB Output is correct
3 Correct 80 ms 24196 KB Output is correct
4 Correct 83 ms 32704 KB Output is correct
5 Correct 80 ms 40896 KB Output is correct
6 Correct 71 ms 18876 KB Output is correct
7 Correct 114 ms 25792 KB Output is correct
8 Correct 91 ms 24120 KB Output is correct
9 Correct 72 ms 36552 KB Output is correct
10 Correct 84 ms 42440 KB Output is correct
11 Correct 141 ms 26196 KB Output is correct
12 Correct 109 ms 22548 KB Output is correct
13 Correct 140 ms 23180 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 2 ms 12380 KB Output is correct
5 Correct 3 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 12376 KB Output is correct
11 Correct 2 ms 12380 KB Output is correct
12 Correct 2 ms 12380 KB Output is correct
13 Correct 3 ms 12380 KB Output is correct
14 Correct 2 ms 12380 KB Output is correct
15 Correct 3 ms 12376 KB Output is correct
16 Correct 2 ms 12380 KB Output is correct
17 Correct 3 ms 12380 KB Output is correct
18 Correct 2 ms 12376 KB Output is correct
19 Correct 3 ms 12380 KB Output is correct
20 Correct 2 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 3 ms 12632 KB Output is correct
24 Correct 3 ms 12380 KB Output is correct
25 Correct 3 ms 12376 KB Output is correct
26 Correct 2 ms 12380 KB Output is correct
27 Correct 3 ms 12380 KB Output is correct
28 Correct 4 ms 12380 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 2 ms 12380 KB Output is correct
5 Correct 3 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 12376 KB Output is correct
11 Correct 2 ms 12380 KB Output is correct
12 Correct 2 ms 12380 KB Output is correct
13 Correct 3 ms 12380 KB Output is correct
14 Correct 2 ms 12380 KB Output is correct
15 Correct 3 ms 12376 KB Output is correct
16 Correct 2 ms 12380 KB Output is correct
17 Correct 3 ms 12380 KB Output is correct
18 Correct 2 ms 12376 KB Output is correct
19 Correct 3 ms 12380 KB Output is correct
20 Correct 2 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 3 ms 12632 KB Output is correct
24 Correct 3 ms 12380 KB Output is correct
25 Correct 3 ms 12376 KB Output is correct
26 Correct 2 ms 12380 KB Output is correct
27 Correct 3 ms 12380 KB Output is correct
28 Correct 4 ms 12380 KB Output is correct
29 Correct 73 ms 26304 KB Output is correct
30 Correct 72 ms 26816 KB Output is correct
31 Correct 64 ms 23684 KB Output is correct
32 Correct 84 ms 57552 KB Output is correct
33 Correct 75 ms 43660 KB Output is correct
34 Correct 79 ms 35472 KB Output is correct
35 Correct 36 ms 18856 KB Output is correct
36 Correct 73 ms 28024 KB Output is correct
37 Correct 86 ms 27336 KB Output is correct
38 Correct 84 ms 56572 KB Output is correct
39 Correct 76 ms 43924 KB Output is correct
40 Correct 78 ms 33220 KB Output is correct
41 Correct 68 ms 24456 KB Output is correct
42 Correct 32 ms 22996 KB Output is correct
43 Correct 76 ms 35316 KB Output is correct
44 Correct 90 ms 58304 KB Output is correct
45 Correct 77 ms 43848 KB Output is correct
46 Correct 77 ms 34960 KB Output is correct
47 Correct 77 ms 24476 KB Output is correct
48 Correct 72 ms 24128 KB Output is correct
49 Correct 73 ms 26568 KB Output is correct
50 Correct 87 ms 59708 KB Output is correct
51 Correct 58 ms 36172 KB Output is correct
52 Correct 73 ms 33388 KB Output is correct
53 Correct 50 ms 29132 KB Output is correct
54 Correct 67 ms 25152 KB Output is correct
55 Correct 74 ms 26052 KB Output is correct
56 Correct 81 ms 59080 KB Output is correct
57 Correct 83 ms 45384 KB Output is correct
58 Correct 77 ms 33984 KB Output is correct
59 Correct 82 ms 29576 KB Output is correct
60 Correct 53 ms 25412 KB Output is correct
61 Correct 74 ms 34908 KB Output is correct
62 Correct 84 ms 34160 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 2 ms 12380 KB Output is correct
5 Correct 3 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 12376 KB Output is correct
11 Correct 2 ms 12380 KB Output is correct
12 Correct 2 ms 12380 KB Output is correct
13 Correct 3 ms 12380 KB Output is correct
14 Correct 2 ms 12380 KB Output is correct
15 Correct 3 ms 12376 KB Output is correct
16 Correct 2 ms 12380 KB Output is correct
17 Correct 3 ms 12380 KB Output is correct
18 Correct 2 ms 12376 KB Output is correct
19 Correct 3 ms 12380 KB Output is correct
20 Correct 2 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 3 ms 12632 KB Output is correct
24 Correct 3 ms 12380 KB Output is correct
25 Correct 3 ms 12376 KB Output is correct
26 Correct 2 ms 12380 KB Output is correct
27 Correct 3 ms 12380 KB Output is correct
28 Correct 4 ms 12380 KB Output is correct
29 Correct 2 ms 12124 KB Output is correct
30 Correct 2 ms 12380 KB Output is correct
31 Correct 2 ms 12380 KB Output is correct
32 Incorrect 2 ms 12380 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 24016 KB Output is correct
2 Correct 121 ms 24924 KB Output is correct
3 Correct 80 ms 24196 KB Output is correct
4 Correct 83 ms 32704 KB Output is correct
5 Correct 80 ms 40896 KB Output is correct
6 Correct 71 ms 18876 KB Output is correct
7 Correct 114 ms 25792 KB Output is correct
8 Correct 91 ms 24120 KB Output is correct
9 Correct 72 ms 36552 KB Output is correct
10 Correct 84 ms 42440 KB Output is correct
11 Correct 141 ms 26196 KB Output is correct
12 Correct 109 ms 22548 KB Output is correct
13 Correct 140 ms 23180 KB Output is correct
14 Correct 2 ms 12120 KB Output is correct
15 Correct 3 ms 12124 KB Output is correct
16 Correct 2 ms 12124 KB Output is correct
17 Correct 2 ms 12380 KB Output is correct
18 Correct 3 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 12376 KB Output is correct
24 Correct 2 ms 12380 KB Output is correct
25 Correct 2 ms 12380 KB Output is correct
26 Correct 3 ms 12380 KB Output is correct
27 Correct 2 ms 12380 KB Output is correct
28 Correct 3 ms 12376 KB Output is correct
29 Correct 2 ms 12380 KB Output is correct
30 Correct 3 ms 12380 KB Output is correct
31 Correct 2 ms 12376 KB Output is correct
32 Correct 3 ms 12380 KB Output is correct
33 Correct 2 ms 12380 KB Output is correct
34 Correct 2 ms 12380 KB Output is correct
35 Correct 2 ms 12380 KB Output is correct
36 Correct 3 ms 12632 KB Output is correct
37 Correct 3 ms 12380 KB Output is correct
38 Correct 3 ms 12376 KB Output is correct
39 Correct 2 ms 12380 KB Output is correct
40 Correct 3 ms 12380 KB Output is correct
41 Correct 4 ms 12380 KB Output is correct
42 Correct 73 ms 26304 KB Output is correct
43 Correct 72 ms 26816 KB Output is correct
44 Correct 64 ms 23684 KB Output is correct
45 Correct 84 ms 57552 KB Output is correct
46 Correct 75 ms 43660 KB Output is correct
47 Correct 79 ms 35472 KB Output is correct
48 Correct 36 ms 18856 KB Output is correct
49 Correct 73 ms 28024 KB Output is correct
50 Correct 86 ms 27336 KB Output is correct
51 Correct 84 ms 56572 KB Output is correct
52 Correct 76 ms 43924 KB Output is correct
53 Correct 78 ms 33220 KB Output is correct
54 Correct 68 ms 24456 KB Output is correct
55 Correct 32 ms 22996 KB Output is correct
56 Correct 76 ms 35316 KB Output is correct
57 Correct 90 ms 58304 KB Output is correct
58 Correct 77 ms 43848 KB Output is correct
59 Correct 77 ms 34960 KB Output is correct
60 Correct 77 ms 24476 KB Output is correct
61 Correct 72 ms 24128 KB Output is correct
62 Correct 73 ms 26568 KB Output is correct
63 Correct 87 ms 59708 KB Output is correct
64 Correct 58 ms 36172 KB Output is correct
65 Correct 73 ms 33388 KB Output is correct
66 Correct 50 ms 29132 KB Output is correct
67 Correct 67 ms 25152 KB Output is correct
68 Correct 74 ms 26052 KB Output is correct
69 Correct 81 ms 59080 KB Output is correct
70 Correct 83 ms 45384 KB Output is correct
71 Correct 77 ms 33984 KB Output is correct
72 Correct 82 ms 29576 KB Output is correct
73 Correct 53 ms 25412 KB Output is correct
74 Correct 74 ms 34908 KB Output is correct
75 Correct 84 ms 34160 KB Output is correct
76 Correct 2 ms 12124 KB Output is correct
77 Correct 2 ms 12380 KB Output is correct
78 Correct 2 ms 12380 KB Output is correct
79 Incorrect 2 ms 12380 KB Output isn't correct
80 Halted 0 ms 0 KB -