# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1126419 | _rain_ | Grapevine (NOI22_grapevine) | C++20 | 1473 ms | 185124 KiB |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int>ii;
#define fi first
#define se second
#define name "main"
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define FORD(i,a,b) for(int i=(b);i>=(a);--i)
#define N 1'00'000
#define MAXL 16
const LL INF=(LL)1e18;
vector<int>ke[N+2];
void add_canh(int u,int v){
ke[u].push_back(v),ke[v].push_back(u);
return;
}
int n,q;
int u[N+2],v[N+2],w[N+2]={};
bool ap[N+2]={};
class IT{
public:
#define lef(id) id*2
#define rig(id) id*2+1
vector<LL>st,lz,mn;
void init(int n){
st.assign(n*4+2,0),lz.assign(n*4+2,0),mn.assign(n*4+2,INF);
# | 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... |