제출 #623225

#제출 시각아이디문제언어결과실행 시간메모리
623225Koosha_mv던전 (IOI21_dungeons)C++17
0 / 100
454 ms979736 KiB
#include "dungeons.h" #include <bits/stdc++.h> using namespace std; #define dbgv(v) cout<<#v<<" = "; f(i,0,int(v.size())) cout<<v[i]<<" "; cout<<endl #define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl #define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl #define eror(x) cout<<#x<<'='<<(x)<<endl #define f_(i,a,b) for(int i=a;i>=b;i--) #define f(i,a,b) for(int i=a;i<b;i++) #define nb(x) __builtin_popcount(x) #define all(v) v.begin(),v.end() #define bit(n,k) (((n)>>(k))&1) #define Add(x,y) x=(x+y)%mod #define maxm(a,b) a=max(a,b) #define minm(a,b) a=min(a,b) #define lst(x) x[x.size()-1] #define sz(x) int(x.size()) #define mp make_pair #define ll long long #define pb push_back #define S second #define F first const int N=400400,lg=25; int n,par[N][lg][lg]; vector<int> s,p,w,l; void init(int _n,vector<int> _s,vector<int> _p,vector<int> _w,vector<int> _l) { n=_n; s=_s,p=_p,w=_w,l=_l; s.pb((1<<(lg-1))); f(i,0,N) f(j,0,lg) f(k,0,lg) par[i][j][k]=i+j+k; } long long simulate(int x, int z) { return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...