Submission #1206294

#TimeUsernameProblemLanguageResultExecution timeMemory
1206294tamzidSeptember (APIO24_september)C++20
0 / 100
1 ms320 KiB
#include "september.h" #include <bits/stdc++.h> using namespace std; using ll = long long; int solve(int N, int M, vector<int> F, vector<vector<int>> S) { if(is_sorted(S[0].rbegin(),S[0].rend())) return -1; int k = 0; std::set<int> s1,s2; for(int i=N-1;i>=1;i--) { if(S[0][i] == i) { ++k; } else { while(S[0][i] != i && s1 != s2) { s1.insert(S[0][i]); s2.insert(i); ++i; } if(s1 == s2) { ++k; s1.clear(); s2.clear(); } } } }

Compilation message (stderr)

september.cpp: In function 'int solve(int, int, std::vector<int>, std::vector<std::vector<int> >)':
september.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
   34 | }
      | ^
#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...