Submission #1202378

#TimeUsernameProblemLanguageResultExecution timeMemory
1202378ElayV13September (APIO24_september)C++20
5 / 100
1095 ms1928 KiB
#include "september.h" #include <bits/stdc++.h> using namespace std; const int N = 11; const int INF = INT_MAX; int solve(int n , int m , vector < int > F , vector < vector < int > > S) { int res = 1; for(int i = 0;i < S[0].size() - 1;i++) { int mn = INF , mx = -INF; for(int j = 0;j <= i;j++) mn = min(mn , S[0][j]); for(int j = i + 1;j < S[0].size();j++) mx = max(mx , S[0][j]); if(mn < mx) continue; res++; } return res; }
#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...