oj.uz

Submission #996964

# Submission time Handle Problem Language Result Execution time Memory
996964 2024-06-11T14:15:01 Z yeediot Jobs (BOI24_jobs) C++17
11 / 100
 105 ms 45576 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], v[mxn], dp[mxn], dp2[mxn], cur;
bool vis[mxn];
void dfs(int now, int pa = 0){
    dp2[now] = cur;
    vis[now] = 1;
    vector<pii>temp;
    int sum = 0, sum2 = 0;
    for(auto u : adj[now]){
        if(u == pa) continue;
        cur += v[u];
        dfs(u, now);
        cur -= v[u];
        if(dp[u] >= 0){
            sum += dp[u];
            temp.pb({dp2[u], u});
            chmin(dp2[now], dp2[u]);
        } 
    }
    sort(all(temp), greater<pii>());
    chmax(dp[now],sum+v[now]);
    //debug(now, dp[now]);
}
signed main(){
    TOI_is_so_de;
    int n, s;
    cin >> n >> s;
    for(int i=1;i<=n;i++){
        cin >> v[i] >> p[i];
        adj[p[i]].pb(i);
    }
    int ans = 0;
    vector<pii>q;
    for(int i=1;i<=n;i++){
        if(p[i]==0){
            cur += v[i];
            dfs(i);
            cur -= v[i];
            q.pb({dp2[i], dp[i]});
        }
    }
    sort(all(q),greater<pii>());
    for(auto [c, V]:q){
        if(s+c>=0 and V>=0){
            ans += V;
            s += V;
        }
    }
    cout << ans << '\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 dfs(long long int, long long int)':
Main.cpp:58:18: warning: unused variable 'sum2' [-Wunused-variable]
   58 |     int sum = 0, sum2 = 0;
      |                  ^~~~
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 87 ms 25172 KB Output is correct
2 Correct 85 ms 24404 KB Output is correct
3 Correct 69 ms 26220 KB Output is correct
4 Correct 72 ms 38484 KB Output is correct
5 Correct 71 ms 45136 KB Output is correct
6 Correct 47 ms 21588 KB Output is correct
7 Correct 71 ms 24276 KB Output is correct
8 Correct 97 ms 26240 KB Output is correct
9 Correct 61 ms 43856 KB Output is correct
10 Correct 71 ms 45576 KB Output is correct
11 Correct 105 ms 24736 KB Output is correct
12 Correct 68 ms 22864 KB Output is correct
13 Correct 76 ms 24660 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 14936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 14936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 14936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 25172 KB Output is correct
2 Correct 85 ms 24404 KB Output is correct
3 Correct 69 ms 26220 KB Output is correct
4 Correct 72 ms 38484 KB Output is correct
5 Correct 71 ms 45136 KB Output is correct
6 Correct 47 ms 21588 KB Output is correct
7 Correct 71 ms 24276 KB Output is correct
8 Correct 97 ms 26240 KB Output is correct
9 Correct 61 ms 43856 KB Output is correct
10 Correct 71 ms 45576 KB Output is correct
11 Correct 105 ms 24736 KB Output is correct
12 Correct 68 ms 22864 KB Output is correct
13 Correct 76 ms 24660 KB Output is correct
14 Incorrect 2 ms 14936 KB Output isn't correct
15 Halted 0 ms 0 KB -