# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075099 | 2024-08-25T18:20:28 Z | Maite_Morale | Closing Time (IOI23_closing) | C++17 | 69 ms | 32084 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define vi vector<int> #define vll vector<ll> #define pll pair<ll,ll> #define vpll vector<pll> #define MAX 500005 #define F first #define S second vpll v[MAX]; ll pass[MAX]; int max_score(int N, int X, int Y, long long K,vi U, vi V, vi W){ for(int i=0;i<=N;i++){v[i]={};pass[i]=0;} for(int i=0;i<V.size();i++){ v[V[i]].push_back({U[i],W[i]}); v[U[i]].push_back({V[i],W[i]}); } priority_queue<pll> q={};ll r=0; q.push({0,X});q.push({0,Y}); while(!q.empty()){ pll u=q.top();q.pop(); if(pass[u.S]==1)continue; pass[u.S]=1; cout<<u.S<<" "<<u.F<<"\n"; if(K+u.F<0)continue; r++;K+=u.F; for(auto w : v[u.S]){ if(pass[w.F]!=1)q.push({u.F-w.S,w.F}); if(pass[w.F]!=1)cout<<"\t"<<u.F-w.S<<" "<<w.F<<"\n"; } } return r; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 12120 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 69 ms | 32084 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 12124 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 12124 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 12124 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 12120 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 12120 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 12120 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 12120 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 12120 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |