Submission #1202380

#TimeUsernameProblemLanguageResultExecution timeMemory
1202380ElayV13September (APIO24_september)C++20
14 / 100
178 ms6712 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;
        set < int > st;
        for(int i = 1;i <= n - 1;i++) st.insert(i);
        int cur_mn = INF;
        for(int i = 0;i < S[0].size() - 1;i++)
        {
                cur_mn = min(cur_mn , S[0][i]);
                st.erase(S[0][i]);
                int mx = *st.rbegin();
                if(cur_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...