Submission #1299045

#TimeUsernameProblemLanguageResultExecution timeMemory
1299045nikakh장애물 (IOI25_obstacles)C++20
0 / 100
48 ms5160 KiB
#include "obstacles.h" #include<bits/stdc++.h> using namespace std; int n,m; vector<int> t,h; void initialize(vector<int>T,vector<int>H){ n=(int)T.size(),m=(int)H.size(); for(int i=0;i<n;i++)t[i]=T[i]; for(int i=0;i<m;i++)h[i]=H[i]; } bool can_reach(int l,int r,int s,int d){ if(t==vector<int>{2,1,3}){ bool fnd0=0; int lst=-1; for(int i=s;i<=d;i++){ if(h[i]>=3)return 0; if(!h[i])fnd0=1; else if(h[i]>=2){ if(!fnd0)return 0; lst=i; } } if(lst==-1)return 1; for(int i=lst+1;i<m;i++){ if(h[i]>=2)return 0; if(!h[i])return 1; } return 0; } for(int i=s;i<=d;i++)if(h[i]>=t[0])return 0; return 1; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...