oj.uz

답안 #284131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
284131 2020-08-26T21:59:59 Z duality Viruses (BOI20_viruses) C++11
100 / 100
 71 ms 4456 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int b[100];
vector<pair<pii,int> > adjList[102];
int trie[51][2],leaf[51],fail[51],nxt[51][2],num = 0;
queue<int> Q;
struct state { ULLI d; int u,a,b; };
class comp {
    public:
        bool operator()(state a,state b) {
            return a.d > b.d;
        }
};
priority_queue<state,vector<state>,comp> H;
ULLI dist[102][51][51];
int main() {
    int i,j;
    int G,N,M;
    int a,k,l,c;
    scanf("%d %d %d",&G,&N,&M);
    int G2 = G;
    memset(trie,-1,sizeof(trie));
    for (i = 0; i < N; i++) {
        scanf("%d %d",&a,&k);
        for (j = 0; j < k; j++) scanf("%d",&b[j]);
        if (k == 1) adjList[b[0]].pb(mp(mp(a,-1),-1));
        else {
            for (j = 1; j < k; j++) {
                if (j == k-1) {
                    adjList[b[j-1]].pb(mp(mp(a,b[j]),1));
                    adjList[b[j]].pb(mp(mp(a,b[j-1]),0));
                }
                else {
                    adjList[b[j-1]].pb(mp(mp(a,G2),1));
                    adjList[G2].pb(mp(mp(a,b[j-1]),0));
                    a = G2++;
                }
            }
        }
    }
    for (i = 0; i < M; i++) {
        scanf("%d",&l);
        int u = 0;
        for (j = 0; j < l; j++) {
            scanf("%d",&c);
            if (trie[u][c] == -1) trie[u][c] = ++num;
            u = trie[u][c];
        }
        leaf[u] = 1;
    }
    num++;

    for (i = 0; i < 2; i++) {
        if (trie[0][i] != -1) nxt[0][i] = trie[0][i],fail[trie[0][i]] = 0,Q.push(trie[0][i]);
        else nxt[0][i] = trie[0][i] = 0;
    }
    while (!Q.empty()) {
        int u = Q.front();
        Q.pop();

        for (i = 0; i < 2; i++) {
            if (trie[u][i] != -1) {
                int v = fail[u];
                while (trie[v][i] == -1) v = fail[v];
                v = trie[v][i];
                fail[trie[u][i]] = v,leaf[trie[u][i]] |= leaf[v];
                nxt[u][i] = trie[u][i],Q.push(trie[u][i]);
            }
            else nxt[u][i] = nxt[fail[u]][i];
        }
    }

    for (i = 0; i < G2; i++) {
        for (j = 0; j < num; j++) fill(dist[i][j],dist[i][j]+num,1ULL << 63);
        sort(adjList[i].begin(),adjList[i].end());
        adjList[i].resize(unique(adjList[i].begin(),adjList[i].end())-adjList[i].begin());
    }
    for (i = 0; i < num; i++) {
        if (leaf[i]) continue;
        for (j = 0; j < 2; j++) {
            if (!leaf[nxt[i][j]]) dist[j][i][nxt[i][j]] = 1,H.push((state){1,j,i,nxt[i][j]});
        }
    }
    while (!H.empty()) {
        ULLI d = H.top().d;
        int u = H.top().u,a = H.top().a,b = H.top().b;
        H.pop();

        if (d > dist[u][a][b]) continue;
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i].first.first,w = adjList[u][i].first.second;
            if (adjList[u][i].second == -1) {
                if (dist[u][a][b] < dist[v][a][b]) {
                    dist[v][a][b] = dist[u][a][b];
                    H.push((state){dist[v][a][b],v,a,b});
                }
            }
            else if (adjList[u][i].second == 0) {
                for (j = 0; j < num; j++) {
                    if (!leaf[j] && (dist[w][j][a]+dist[u][a][b] < dist[v][j][b])) {
                        dist[v][j][b] = dist[w][j][a]+dist[u][a][b];
                        H.push((state){dist[v][j][b],v,j,b});
                    }
                }
            }
            else {
                for (j = 0; j < num; j++) {
                    if (!leaf[j] && (dist[u][a][b]+dist[w][b][j] < dist[v][a][j])) {
                        dist[v][a][j] = dist[u][a][b]+dist[w][b][j];
                        H.push((state){dist[v][a][j],v,a,j});
                    }
                }
            }
        }
    }
    for (i = 2; i < G; i++) {
        ULLI d = 1ULL << 63;
        for (j = 0; j < num; j++) {
            if (!leaf[j]) d = min(d,dist[i][0][j]);
        }
        if (d == (1ULL << 63)) printf("YES\n");
        else printf("NO %llu\n",d);
    }

    return 0;
}

Compilation message

Viruses.cpp: In function 'int main()':
Viruses.cpp:145:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |         for (i = 0; i < adjList[u].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~
Viruses.cpp:75:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   75 |     scanf("%d %d %d",&G,&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~
Viruses.cpp:79:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   79 |         scanf("%d %d",&a,&k);
      |         ~~~~~^~~~~~~~~~~~~~~
Viruses.cpp:80:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   80 |         for (j = 0; j < k; j++) scanf("%d",&b[j]);
      |                                 ~~~~~^~~~~~~~~~~~
Viruses.cpp:97:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   97 |         scanf("%d",&l);
      |         ~~~~~^~~~~~~~~
Viruses.cpp:100:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  100 |             scanf("%d",&c);
      |             ~~~~~^~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 544 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 640 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 544 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 508 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 2 ms 2304 KB Output is correct
5 Correct 1 ms 1408 KB Output is correct
6 Correct 2 ms 1408 KB Output is correct
7 Correct 2 ms 1664 KB Output is correct
8 Correct 2 ms 1792 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 1024 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 1280 KB Output is correct
14 Correct 1 ms 896 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 1024 KB Output is correct
18 Correct 1 ms 1024 KB Output is correct
19 Correct 1 ms 896 KB Output is correct
20 Correct 1 ms 1152 KB Output is correct
21 Correct 1 ms 1024 KB Output is correct
22 Correct 1 ms 640 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1408 KB Output is correct
2 Correct 2 ms 2304 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 2 ms 1408 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 640 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 1 ms 640 KB Output is correct
12 Correct 1 ms 640 KB Output is correct
13 Correct 1 ms 640 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 1 ms 640 KB Output is correct
17 Correct 1 ms 640 KB Output is correct
18 Correct 1 ms 640 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 848 KB Output is correct
23 Correct 1 ms 640 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 8 ms 1152 KB Output is correct
26 Correct 2 ms 1408 KB Output is correct
27 Correct 49 ms 1664 KB Output is correct
28 Correct 4 ms 1792 KB Output is correct
29 Correct 67 ms 4456 KB Output is correct
30 Correct 65 ms 4436 KB Output is correct
31 Correct 6 ms 1792 KB Output is correct
32 Correct 3 ms 1792 KB Output is correct
33 Correct 2 ms 1280 KB Output is correct
34 Correct 71 ms 2800 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 544 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 640 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 544 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 508 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 640 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 640 KB Output is correct
26 Correct 1 ms 640 KB Output is correct
27 Correct 1 ms 640 KB Output is correct
28 Correct 1 ms 640 KB Output is correct
29 Correct 1 ms 640 KB Output is correct
30 Correct 1 ms 640 KB Output is correct
31 Correct 1 ms 640 KB Output is correct
32 Correct 1 ms 640 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 1 ms 848 KB Output is correct
37 Correct 1 ms 640 KB Output is correct
38 Correct 1 ms 640 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 1 ms 512 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 512 KB Output is correct
43 Correct 1 ms 768 KB Output is correct
44 Correct 1 ms 640 KB Output is correct
45 Correct 1 ms 768 KB Output is correct
46 Correct 1 ms 768 KB Output is correct
47 Correct 1 ms 764 KB Output is correct
48 Correct 1 ms 768 KB Output is correct
49 Correct 1 ms 768 KB Output is correct
50 Correct 1 ms 768 KB Output is correct
51 Correct 1 ms 768 KB Output is correct
52 Correct 1 ms 768 KB Output is correct
53 Correct 1 ms 768 KB Output is correct
54 Correct 1 ms 768 KB Output is correct
55 Correct 1 ms 640 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 544 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 640 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 544 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 508 KB Output is correct
21 Correct 1 ms 1408 KB Output is correct
22 Correct 2 ms 2304 KB Output is correct
23 Correct 1 ms 1408 KB Output is correct
24 Correct 2 ms 1408 KB Output is correct
25 Correct 2 ms 1664 KB Output is correct
26 Correct 2 ms 1792 KB Output is correct
27 Correct 1 ms 1152 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 1024 KB Output is correct
30 Correct 1 ms 768 KB Output is correct
31 Correct 1 ms 1280 KB Output is correct
32 Correct 1 ms 896 KB Output is correct
33 Correct 2 ms 1152 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 1 ms 1024 KB Output is correct
36 Correct 1 ms 1024 KB Output is correct
37 Correct 1 ms 896 KB Output is correct
38 Correct 1 ms 1152 KB Output is correct
39 Correct 1 ms 1024 KB Output is correct
40 Correct 1 ms 640 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 512 KB Output is correct
44 Correct 1 ms 640 KB Output is correct
45 Correct 1 ms 640 KB Output is correct
46 Correct 1 ms 640 KB Output is correct
47 Correct 1 ms 640 KB Output is correct
48 Correct 1 ms 640 KB Output is correct
49 Correct 1 ms 640 KB Output is correct
50 Correct 1 ms 640 KB Output is correct
51 Correct 1 ms 640 KB Output is correct
52 Correct 1 ms 640 KB Output is correct
53 Correct 1 ms 640 KB Output is correct
54 Correct 1 ms 512 KB Output is correct
55 Correct 1 ms 512 KB Output is correct
56 Correct 1 ms 512 KB Output is correct
57 Correct 1 ms 848 KB Output is correct
58 Correct 1 ms 640 KB Output is correct
59 Correct 1 ms 640 KB Output is correct
60 Correct 8 ms 1152 KB Output is correct
61 Correct 2 ms 1408 KB Output is correct
62 Correct 49 ms 1664 KB Output is correct
63 Correct 4 ms 1792 KB Output is correct
64 Correct 67 ms 4456 KB Output is correct
65 Correct 65 ms 4436 KB Output is correct
66 Correct 6 ms 1792 KB Output is correct
67 Correct 3 ms 1792 KB Output is correct
68 Correct 2 ms 1280 KB Output is correct
69 Correct 71 ms 2800 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 1 ms 512 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 1 ms 512 KB Output is correct
74 Correct 1 ms 768 KB Output is correct
75 Correct 1 ms 640 KB Output is correct
76 Correct 1 ms 768 KB Output is correct
77 Correct 1 ms 768 KB Output is correct
78 Correct 1 ms 764 KB Output is correct
79 Correct 1 ms 768 KB Output is correct
80 Correct 1 ms 768 KB Output is correct
81 Correct 1 ms 768 KB Output is correct
82 Correct 1 ms 768 KB Output is correct
83 Correct 1 ms 768 KB Output is correct
84 Correct 1 ms 768 KB Output is correct
85 Correct 1 ms 768 KB Output is correct
86 Correct 1 ms 640 KB Output is correct
87 Correct 6 ms 1152 KB Output is correct
88 Correct 1 ms 384 KB Output is correct
89 Correct 1 ms 384 KB Output is correct
90 Correct 1 ms 1152 KB Output is correct
91 Correct 1 ms 896 KB Output is correct
92 Correct 25 ms 2208 KB Output is correct
93 Correct 15 ms 2172 KB Output is correct
94 Correct 2 ms 1408 KB Output is correct
95 Correct 1 ms 1152 KB Output is correct
96 Correct 1 ms 1408 KB Output is correct
97 Correct 5 ms 1600 KB Output is correct
98 Correct 1 ms 1536 KB Output is correct
99 Correct 9 ms 1920 KB Output is correct
100 Correct 3 ms 1408 KB Output is correct
101 Correct 3 ms 1408 KB Output is correct
102 Correct 51 ms 2548 KB Output is correct
103 Correct 3 ms 1792 KB Output is correct
104 Correct 11 ms 1792 KB Output is correct
105 Correct 1 ms 896 KB Output is correct
106 Correct 20 ms 2044 KB Output is correct
107 Correct 22 ms 2044 KB Output is correct