제출 #979996

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
979996	2024-05-11 19:04:50	avita	게임 (APIO22_game)	C++17	100 / 100	1261 ms	64520 KiB

game

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 "game.h"
#include<bits/stdc++.h>
using namespace std;
 
const int maxn=300005;
int n, k, ok, l[maxn], r[maxn], layer[maxn];
vector <int> A[maxn], At[maxn];
 
void propagate(int u)
{
    if (ok) return;
    if (r[u]<=l[u]) return ok=1, void();
    int j=__lg(l[u]^r[u]);
    if (layer[u]>j) layer[u]=j; 
    else return;
    for (int v:A[u]) l[v]=max(l[v], l[u]), propagate(v);
    for (int v:At[u]) r[v]=min(r[v], r[u]), propagate(v);
}
 
int add_teleporter(int u, int v)
{
    A[u].push_back(v), At[v].push_back(u);
    l[v]=max(l[v], max(l[u], u<k?u:-1)), propagate(v);
    r[u]=min(r[u], min(r[v], v<k?v:k)), propagate(u);
    return ok;
}
 
void init(int N, int K)
{
    n=N, k=K;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 2 / 2
• Subtask 2: 10 / 10
• Subtask 3: 18 / 18
• Subtask 4: 30 / 30
• Subtask 5: 40 / 40