Submission #1202365

#	Time	Username	Problem	Language	Result	Execution time	Memory
1202365		ElayV13	9월 (APIO24_september)	C++20	0 / 100	0 ms	324 KiB

september

#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 idx[n];
        for(int i = 0;i < S[0].size();i++) idx[S[0][i]] = i;
        int res = 0;
        vector < bool > vis(n + 1 , false);
        for(int i = n - 1;i >= 1;i--)
        {
                if(vis[i]) continue;
                ++res;
                for(int j = idx[i];j >= 0;j--) vis[j] = 1;
        }
        return res;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 5
• Subtask 4: 0 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 0 / 9
• Subtask 8: 0 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16