제출 #1194141

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1194141		alex_2008	9월 (APIO24_september)	C++20	100 / 100	94 ms	10944 KiB

september

#include "september.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <deque>
#include <queue>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
vector <vector<int>> G;
int uncert[10];
bool marked[10][N];
int diff[10];
int solve(int n, int m, vector <int> par, vector <vector<int>> a) {
    G.resize(n);
    for (int i = 0; i < n; i++) {
        G[i].clear();
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            marked[i][j] = false;
        }
        uncert[i] = 0;
        diff[i] = 0;
    }
    for (int i = 1; i < n; i++) {
        G[par[i]].push_back(i);
    }
    int ans = 0;
    for (int j = 0; j < n - 1; j++) {
        bool ch = true;
        for (int i = 0; i < m; i++) {
            if (i == 0) {
                for (int q = 1; q < m; q++) {
                    if (marked[q][a[i][j]]) {
                        diff[q]--;
                    }
                    else diff[q]++;
                }
            }
            else {
                if (marked[0][a[i][j]]) diff[i]--;
                else diff[i]++;
            }
            marked[i][a[i][j]] = true;
            for (auto it : G[a[i][j]]) {
                if (!marked[i][it]) uncert[i]++;
            }
            if (marked[i][par[a[i][j]]]) uncert[i]--;
            if (uncert[i] > 0) ch = false;
            if (diff[i] > 0) ch = false;
        }
        if (ch) ans++;
    }
    return ans;
}

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