제출 #1311146

#제출 시각아이디문제언어결과실행 시간메모리
1311146vanguard9월 (APIO24_september)C++20
0 / 100
1 ms568 KiB
#include "september.h" #include <bits/stdc++.h> using namespace std; int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) { std::vector<int> counts(N, 0); int current_mismatches = 0; int day_count = 0; for (int i = 0; i < N - 1; i++) { for (int j = 0; j < M; j++) { int node = S[j][i]; counts[node]++; if (counts[node] == 1) { current_mismatches++; } if (counts[node] == M) { current_mismatches--; } } if (current_mismatches == 0) { day_count++; } } return day_count; }
#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...