Submission #1311146

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311146		vanguard	September (APIO24_september)	C++20	0 / 100	1 ms	568 KiB

september

#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;
}

• 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