제출 #1233301

#제출 시각아이디문제언어결과실행 시간메모리
1233301coco2311Bouquet (EGOI24_bouquet)C++17
8 / 100
17 ms2632 KiB
#include <iostream> using namespace std; #define f first #define s second int main(){ ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); // freopen("input.in","r",stdin); int N;cin>>N; pair<int,int> d[N]; int nT[N]; for(int i=0;i<N;i++){ cin>>d[i].f>>d[i].s; } for(int i=0;i<N;i++){ if((i-d[i].f-1) < 0){ nT[i]=1; } else{ nT[i]=nT[(i-d[i].f-1)]+1; } } cout<<nT[N-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...