Submission #1125015

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1125015	2024-12-07 18:20:39	LaMatematica14	Bitaro’s Party (JOI18_bitaro)	C++20	0 / 100	1 ms	320 KiB

bitaro

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int rad = 333;
int N;
vector<vector<int>> adj;
vector<vector<pair<int, int>>> dp;
void crea(int a) {
    unordered_set<int> pr;
    int dc = adj[a].size();
    vector<int> id(dc, 0);
    bool ff = 1;
    int h = 0;
    while (h < rad) {
        int best = -1, idb = -1;
        for (int i = 0; i < dc; i++) {
            while (id[i] < dp[adj[a][i]].size() && pr.count(dp[adj[a][i]][id[i]].second)) id[i]++;
            if (id[i] >= dp[adj[a][i]].size()) continue;
            if (dp[adj[a][i]][id[i]].first > best) {
                idb = i;
                best = dp[adj[a][i]][id[i]].first; 
            }
        }
        if (idb < 0) {
            ff = 0; break;
        }
        pr.insert(dp[adj[a][idb]][id[idb]].second);
        dp[a][h] = dp[adj[a][idb]][id[idb]];
        dp[a][h++].first++;
        id[idb]++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 86