제출 #1202367

#제출 시각아이디문제언어결과실행 시간메모리
1202367ElayV139월 (APIO24_september)C++20
0 / 100
1 ms328 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 = 0;
        for(int i = 0;i < S[0].size();i++)
        {
                bool can = 1;
                for(int j = i + 1;j < S[0].size();j++) if(S[0][j] > S[0][i]) can = 0;
                res += can;
        }
        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...