# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1150745 | Warinchai | Grapevine (NOI22_grapevine) | C++20 | 305 ms | 86112 KiB |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,q;
vector<int>adj[400005];
int w[800025];
int have[800025];
map<pair<int,int>,int>mp;
int inf=1e15+5;
struct path{
int mn,dis;
path(int x=inf,int d=0){
mn=x;
dis=d;
}
friend path operator+(path a,path b){
return path(min(a.mn,b.mn+a.dis),a.dis+b.dis);
}
}paths[800025],rpaths[800025];
struct point{
int mn;
point(int x=inf){
mn=x;
}
friend point operator+(point a,point b){
return point(min(a.mn,b.mn));
}
}points[800025];
path compress(path a,path b){
return a+b;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |