Submission #1294277

#TimeUsernameProblemLanguageResultExecution timeMemory
1294277eri16September (APIO24_september)C++20
0 / 100
2 ms568 KiB
#include <bits/stdc++.h> using namespace std; int solve(int n, int m, vector<int> v1,vector<vector<int>> v2){ vector <int> v(n); for (int i=1; i<n; i++){ v[i]=0; } int k=1; int days=n-1; for (int i=n-2; i>=0; i--){ if (k!=v2[0][i]){ v[v2[0][i]]=1; days--; for (int j=i-1; j>=n-v2[0][i]; j--){ v[v2[0][j]]=1; days--; i--; } } else{ v[k]=1; for (int j=k; j<n; j++){ if (v[j]==0){ break; } k++; } } } return days; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...