제출 #703632

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
703632	2023-02-27 21:56:25	kinope	From Hacks to Snitches (BOI21_watchmen)	C++14	15 / 100	6059 ms	291572 KiB

watchmen

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>
#define ff first
#define ss second
using namespace std;
typedef pair<int, int> pii;
struct info{
    int x, k, mod;
    info(){}
    info(int x, int k, int mod) : x(x), k(k), mod(mod) {}
};void get(int &a){
    char c = getchar_unlocked(); a = 0;
    while(c<'0'||'9'<c) c = getchar_unlocked();
    while('0'<=c&&c<='9') a = (a<<3)+(a<<1)+c-'0', c = getchar_unlocked();
}
int main(){
    int n, m, a, b; get(n), get(m);
    vector<vector<int>> g(n+1);
    for(int i = 0; i < m; ++i) get(a), get(b), g[a].emplace_back(b), g[b].emplace_back(a);
    int k; get(k);
    vector<pii> ktcykl(n+1);
    vector<int> sz(k+1); sz[0] = 1;
    vector<vector<vector<int>>> dp(n+1);
    for(int i = 1; i <= n; ++i) dp[i].resize(k+1);
    for(int i = 1; i <= n; ++i) dp[i][0].emplace_back(2e09);
    for(int i = 1; i <= k; ++i){
        get(b), sz[i] = b;
        for(int j = 1; j <= n; ++j) dp[j][i].resize(b, 2e09);
        for(int j = 0; j < b; ++j) get(a), ktcykl[a] = pii(i, j);
    }
    queue<info> q;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 25
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20