Submission #1360000

#	Time	Username	Problem	Language	Result	Execution time	Memory
1360000		sameer	9월 (APIO24_september)	C++20	0 / 100	0 ms	836 KiB

september

#include "september.h"
#include <vector>

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
 int i, j, k, n = N, m = M, ans, va[100007];
 for( i = 0; i <= n; i++) va[i] = 0;

 for( i = 0, k = 0, ans = 0; i < n-1; i++){
 for( j = 0; j < m; j++){
 va[S[j][i]]++;
 if(va[S[j][i]] == m) k++;
 }
 if(k >= i+1) ans++;
 }
 return ans;
}

• 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