Submission #644165

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
644165	2022-09-24 02:23:01	jumpOverTheWall	LOSTIKS (INOI20_lostiks)	C++14	59 / 100	2068 ms	160768 KiB

Main

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 N = 1e6;
int n, m, s, t, val[N], d[22][N], r[22][N];
int dp[1 << 20][20], key[22], num[22], door[22], distDoor[22], reqDoor[22], dist[22][22], req[22][22];
vector<pair<int, int>> adj[N];
void Dfs(int u, int p, int keyInd) {
    for(auto e : adj[u]) {
        int v = e.first;
        int ind = e.second;
        if (v == p)
            continue;
        r[keyInd][v] = r[keyInd][u] | val[ind];
        d[keyInd][v] = d[keyInd][u] + 1;
        if (keyInd != -1 && val[ind] == (1 << keyInd)) {
            door[keyInd] = u;
            distDoor[keyInd] = d[keyInd][u];
            reqDoor[keyInd] = r[keyInd][u];
        }
        Dfs(v, u, keyInd);
    }
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> s >> t;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 23 / 23
• Subtask 2: 36 / 36
• Subtask 3: 0 / 41