| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 997058 |
2024-06-11T16:28:30 Z |
yeediot |
Jobs (BOI24_jobs) |
C++17 |
|
141 ms |
38888 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) 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);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
139 ms |
24024 KB |
Output is correct |
| 2 |
Correct |
113 ms |
24280 KB |
Output is correct |
| 3 |
Correct |
83 ms |
23732 KB |
Output is correct |
| 4 |
Correct |
89 ms |
34000 KB |
Output is correct |
| 5 |
Correct |
68 ms |
37968 KB |
Output is correct |
| 6 |
Correct |
69 ms |
18900 KB |
Output is correct |
| 7 |
Correct |
113 ms |
25736 KB |
Output is correct |
| 8 |
Correct |
87 ms |
24732 KB |
Output is correct |
| 9 |
Correct |
77 ms |
38888 KB |
Output is correct |
| 10 |
Correct |
65 ms |
38552 KB |
Output is correct |
| 11 |
Correct |
141 ms |
27724 KB |
Output is correct |
| 12 |
Correct |
112 ms |
22336 KB |
Output is correct |
| 13 |
Correct |
133 ms |
23152 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
12124 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
12124 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
12124 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
139 ms |
24024 KB |
Output is correct |
| 2 |
Correct |
113 ms |
24280 KB |
Output is correct |
| 3 |
Correct |
83 ms |
23732 KB |
Output is correct |
| 4 |
Correct |
89 ms |
34000 KB |
Output is correct |
| 5 |
Correct |
68 ms |
37968 KB |
Output is correct |
| 6 |
Correct |
69 ms |
18900 KB |
Output is correct |
| 7 |
Correct |
113 ms |
25736 KB |
Output is correct |
| 8 |
Correct |
87 ms |
24732 KB |
Output is correct |
| 9 |
Correct |
77 ms |
38888 KB |
Output is correct |
| 10 |
Correct |
65 ms |
38552 KB |
Output is correct |
| 11 |
Correct |
141 ms |
27724 KB |
Output is correct |
| 12 |
Correct |
112 ms |
22336 KB |
Output is correct |
| 13 |
Correct |
133 ms |
23152 KB |
Output is correct |
| 14 |
Incorrect |
2 ms |
12124 KB |
Output isn't correct |
| 15 |
Halted |
0 ms |
0 KB |
- |
