oj.uz

Submission #907397

# Submission time Handle Problem Language Result Execution time Memory
907397 2024-01-15T13:29:15 Z abcvuitunggio Thousands Islands (IOI22_islands) C++17
70.75 / 100
 112 ms 31376 KB 
#include "islands.h"
#include <variant>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
vector <int> u,v,ke[200001],ke2[200001],adj[200001],boring,res,ve;
int ch[200001],pos[200001],deg[200001],x,C;
void strain(){
    while (deg[x]==1){
        for (int i:ke[x]){
            int y=u[i]^v[i]^x;
            if (!ch[y]){
                boring.push_back(i);
                for (int i:ke2[x]){
                    int y=u[i]^v[i]^x;
                    if (!ch[y]&&!--deg[y])
                        ve.push_back(y);
                }
                C=0;
                ch[x]=1;
                x=y;
                break;
            }
        }
    }
}
void strain2(){
    while (!ve.empty()){
        C=0;
        int x=ve.back();
        ve.pop_back();
        ch[x]=1;
        for (int i:ke2[x]){
            int y=u[i]^v[i]^x;
            if (ch[y])
                continue;
            if (!--deg[y])
                ve.push_back(y);
        }
    }
}
pair <vector <int>, vector <int>> dfs(int s, int x){
    vector <int> ve,cycle;
    memset(pos,-1,sizeof(pos));
    ve.push_back(x);
    pos[x]=0;
    x=u[x]^v[x]^s;
    while (pos[adj[x][0]]==-1){
        int i=adj[x][0];
        int y=u[i]^v[i]^x;
        x=y;
        pos[i]=ve.size();
        ve.push_back(i);
    }
    x=adj[x][0];
    for (int i=pos[x];i<ve.size();i++)
        cycle.push_back(ve[i]);
    while (ve.size()>pos[x])
        ve.pop_back();
    return {ve,cycle};
}
bool check(vector <int> a, vector <int> b){
    if (a.size()!=b.size())
        return false;
    memset(ch,0,sizeof(ch));
    for (int i:a)
        ch[i]=1;
    for (int i:b)
        if (!ch[i])
            return true;
    return false;
}
vector <int> rev(vector <int> v){
    reverse(v.begin(),v.end());
    return v;
}
vector <int> operator +(vector <int> a, vector <int> b){
    for (int i:b)
        a.push_back(i);
    return a;
}
variant <bool, vector <int>> find_journey(int n, int m, vector <int> U, vector <int> V) {
    u=U,v=V;
    for (int i=0;i<m;i++){
        ke[u[i]].push_back(i);
        ke2[v[i]].push_back(i);
        deg[u[i]]++;
    }
    for (int i=0;i<n;i++)
        if (!deg[i])
            ve.push_back(i);
    while (!C){
        C=1;
        strain();
        strain2();
    }
    if (ch[x])
        return false;
    for (int i=0;i<n;i++)
        for (int j:ke[i])
            if (!ch[u[j]^v[j]^i])
                adj[i].push_back(j);
    auto [ve,c]=dfs(x,adj[x][0]);
    auto [ve2,c2]=dfs(x,adj[x][1]);
    res=boring+ve+c+rev(ve)+ve2;
    if (check(c,c2))
        res=res+c2+rev(ve2)+ve+rev(ve+c)+ve2;
    return res+rev(boring+ve2+c2);
}

Compilation message

islands.cpp: In function 'std::pair<std::vector<int>, std::vector<int> > dfs(int, int)':
islands.cpp:57:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for (int i=pos[x];i<ve.size();i++)
      |                       ~^~~~~~~~~~
islands.cpp:59:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |     while (ve.size()>pos[x])
      |            ~~~~~~~~~^~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15704 KB Output is correct
2 Correct 6 ms 15964 KB Output is correct
3 Correct 5 ms 15704 KB Output is correct
4 Correct 5 ms 15960 KB Output is correct
5 Correct 5 ms 15708 KB Output is correct
6 Correct 5 ms 15964 KB Output is correct
7 Correct 33 ms 23308 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15960 KB Output is correct
2 Correct 5 ms 15708 KB Output is correct
3 Correct 5 ms 15964 KB Output is correct
4 Correct 5 ms 15964 KB Output is correct
5 Correct 5 ms 15964 KB Output is correct
6 Correct 28 ms 22236 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 16220 KB Output is correct
2 Correct 5 ms 15704 KB Output is correct
3 Correct 5 ms 15708 KB Output is correct
4 Correct 5 ms 15964 KB Output is correct
5 Correct 5 ms 15964 KB Output is correct
6 Correct 5 ms 15964 KB Output is correct
7 Correct 5 ms 15708 KB Output is correct
8 Correct 5 ms 15964 KB Output is correct
9 Correct 6 ms 15964 KB Output is correct
10 Correct 5 ms 16220 KB Output is correct
11 Correct 5 ms 15964 KB Output is correct
12 Correct 6 ms 16220 KB Output is correct
13 Correct 5 ms 15708 KB Output is correct
14 Correct 5 ms 15708 KB Output is correct
15 Correct 5 ms 16104 KB Output is correct
16 Correct 6 ms 15708 KB Output is correct
17 Correct 20 ms 20060 KB Output is correct
18 Correct 23 ms 19800 KB Output is correct
19 Correct 4 ms 15708 KB Output is correct
20 Correct 5 ms 15964 KB Output is correct
21 Correct 5 ms 16044 KB Output is correct
22 Correct 5 ms 16096 KB Output is correct
23 Correct 28 ms 22364 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15964 KB Output is correct
2 Correct 5 ms 16220 KB Output is correct
3 Correct 30 ms 22140 KB Output is correct
4 Correct 32 ms 22480 KB Output is correct
5 Correct 5 ms 16216 KB Output is correct
6 Correct 6 ms 16220 KB Output is correct
7 Correct 5 ms 16084 KB Output is correct
8 Correct 5 ms 15964 KB Output is correct
9 Correct 5 ms 15964 KB Output is correct
10 Correct 6 ms 16220 KB Output is correct
11 Correct 6 ms 16208 KB Output is correct
12 Correct 7 ms 16220 KB Output is correct
13 Correct 6 ms 16300 KB Output is correct
14 Correct 8 ms 16220 KB Output is correct
15 Correct 6 ms 16220 KB Output is correct
16 Correct 5 ms 16220 KB Output is correct
17 Correct 6 ms 15704 KB Output is correct
18 Correct 6 ms 16220 KB Output is correct
19 Correct 5 ms 15964 KB Output is correct
20 Correct 32 ms 22812 KB Output is correct
21 Correct 33 ms 22364 KB Output is correct
22 Correct 6 ms 15960 KB Output is correct
23 Correct 6 ms 16040 KB Output is correct
24 Correct 4 ms 15708 KB Output is correct
25 Correct 5 ms 15964 KB Output is correct
26 Correct 5 ms 16220 KB Output is correct
27 Correct 34 ms 22856 KB Output is correct
28 Correct 33 ms 22868 KB Output is correct
29 Correct 5 ms 15704 KB Output is correct
30 Correct 34 ms 23124 KB Output is correct
31 Correct 5 ms 15964 KB Output is correct
32 Correct 32 ms 22648 KB Output is correct
33 Correct 34 ms 22732 KB Output is correct
34 Correct 21 ms 20056 KB Output is correct
35 Correct 7 ms 15964 KB Output is correct
36 Correct 30 ms 21688 KB Output is correct
37 Correct 33 ms 23380 KB Output is correct
38 Correct 5 ms 15708 KB Output is correct
39 Correct 28 ms 21644 KB Output is correct
40 Correct 6 ms 16220 KB Output is correct
41 Correct 34 ms 23316 KB Output is correct
42 Correct 33 ms 22876 KB Output is correct
43 Correct 5 ms 15708 KB Output is correct
44 Correct 6 ms 15964 KB Output is correct
45 Correct 5 ms 16220 KB Output is correct
46 Correct 18 ms 19320 KB Output is correct

Subtask #5
15.75 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15704 KB Output is correct
2 Correct 6 ms 15964 KB Output is correct
3 Correct 5 ms 15704 KB Output is correct
4 Correct 5 ms 15960 KB Output is correct
5 Correct 5 ms 15708 KB Output is correct
6 Correct 5 ms 15964 KB Output is correct
7 Correct 33 ms 23308 KB Output is correct
8 Correct 5 ms 15960 KB Output is correct
9 Correct 5 ms 15708 KB Output is correct
10 Correct 5 ms 15964 KB Output is correct
11 Correct 5 ms 15964 KB Output is correct
12 Correct 5 ms 15964 KB Output is correct
13 Correct 28 ms 22236 KB Output is correct
14 Correct 6 ms 16220 KB Output is correct
15 Correct 5 ms 15704 KB Output is correct
16 Correct 5 ms 15708 KB Output is correct
17 Correct 5 ms 15964 KB Output is correct
18 Correct 5 ms 15964 KB Output is correct
19 Correct 5 ms 15964 KB Output is correct
20 Correct 5 ms 15708 KB Output is correct
21 Correct 5 ms 15964 KB Output is correct
22 Correct 6 ms 15964 KB Output is correct
23 Correct 5 ms 16220 KB Output is correct
24 Correct 5 ms 15964 KB Output is correct
25 Correct 6 ms 16220 KB Output is correct
26 Correct 5 ms 15708 KB Output is correct
27 Correct 5 ms 15708 KB Output is correct
28 Correct 5 ms 16104 KB Output is correct
29 Correct 6 ms 15708 KB Output is correct
30 Correct 20 ms 20060 KB Output is correct
31 Correct 23 ms 19800 KB Output is correct
32 Correct 4 ms 15708 KB Output is correct
33 Correct 5 ms 15964 KB Output is correct
34 Correct 5 ms 16044 KB Output is correct
35 Correct 5 ms 16096 KB Output is correct
36 Correct 28 ms 22364 KB Output is correct
37 Correct 4 ms 15964 KB Output is correct
38 Correct 4 ms 15848 KB Output is correct
39 Correct 5 ms 16164 KB Output is correct
40 Correct 6 ms 15708 KB Output is correct
41 Correct 17 ms 18884 KB Output is correct
42 Correct 5 ms 15964 KB Output is correct
43 Correct 33 ms 21544 KB Output is correct
44 Correct 39 ms 21640 KB Output is correct
45 Correct 36 ms 21712 KB Output is correct
46 Correct 5 ms 15960 KB Output is correct
47 Correct 5 ms 15964 KB Output is correct
48 Correct 4 ms 15964 KB Output is correct
49 Correct 5 ms 16220 KB Output is correct
50 Correct 99 ms 30640 KB Output is correct
51 Correct 75 ms 27428 KB Output is correct
52 Correct 74 ms 27596 KB Output is correct
53 Correct 79 ms 27780 KB Output is correct
54 Correct 81 ms 27564 KB Output is correct
55 Correct 73 ms 27604 KB Output is correct
56 Correct 107 ms 27652 KB Output is correct
57 Correct 55 ms 28104 KB Output is correct
58 Partially correct 82 ms 28824 KB Output is partially correct
59 Correct 67 ms 26648 KB Output is correct
60 Correct 64 ms 26204 KB Output is correct
61 Correct 71 ms 26116 KB Output is correct
62 Correct 16 ms 18264 KB Output is correct
63 Correct 59 ms 26064 KB Output is correct
64 Partially correct 24 ms 19804 KB Output is partially correct
65 Correct 5 ms 15964 KB Output is correct
66 Correct 5 ms 15964 KB Output is correct
67 Correct 87 ms 29192 KB Output is correct
68 Correct 35 ms 23300 KB Output is correct
69 Correct 42 ms 22996 KB Output is correct
70 Correct 5 ms 16220 KB Output is correct
71 Correct 53 ms 22968 KB Output is correct
72 Correct 5 ms 15960 KB Output is correct
73 Correct 60 ms 25428 KB Output is correct
74 Correct 92 ms 31376 KB Output is correct
75 Partially correct 7 ms 16476 KB Output is partially correct
76 Correct 39 ms 22848 KB Output is correct
77 Correct 58 ms 25300 KB Output is correct
78 Correct 73 ms 26116 KB Output is correct
79 Partially correct 5 ms 15960 KB Output is partially correct
80 Correct 112 ms 30632 KB Output is correct
81 Partially correct 5 ms 16220 KB Output is partially correct
82 Correct 30 ms 22452 KB Output is correct
83 Partially correct 5 ms 15964 KB Output is partially correct
84 Correct 5 ms 15964 KB Output is correct
85 Partially correct 35 ms 22532 KB Output is partially correct
86 Partially correct 5 ms 16220 KB Output is partially correct
87 Correct 6 ms 16856 KB Output is correct
88 Correct 6 ms 16220 KB Output is correct
89 Correct 74 ms 26128 KB Output is correct
90 Correct 70 ms 26072 KB Output is correct
91 Correct 91 ms 30140 KB Output is correct
92 Partially correct 5 ms 15960 KB Output is partially correct