oj.uz

Submission #907229

# Submission time Handle Problem Language Result Execution time Memory
907229 2024-01-15T09:50:45 Z abcvuitunggio Thousands Islands (IOI22_islands) C++17
19.25 / 100
 55 ms 48620 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,fun,res,ve;
int n,m,ch[200001],pos[200001],deg[200001];
pair <vector <int>, vector <int>> dfs(int s, int x){
    vector <int> ve,cycle;
    memset(pos,-1,sizeof(pos));
    ve.push_back(x);
    x=u[x]^v[x]^s;
    while (pos[x]==-1){
        pos[x]=ve.size();
        int i=adj[x][0];
        int y=u[i]^v[i]^x;
        x=y;
        ve.push_back(i);
    }
    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){
    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) {
    n=N,m=M,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]){
            ch[i]=1;
            ve.push_back(i);
        }
    while (!ve.empty()){
        int x=ve.back();
        ve.pop_back();
        ch[x]=1;
        for (int i:ke2[x]){
            int y=u[i]^v[i]^x;
            if (!--deg[y])
                ve.push_back(y);
        }
    }
    if (ch[0])
        return false;
    int x=0;
    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])
                    deg[u[i]^v[i]^x]--;
                ch[x]=1;
                x=y;
                break;
            }
        }
    }
    if (!deg[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]);
    if (check(c,c2))
        fun=ve+c+rev(ve)+ve2+rev(c2)+rev(ve2);
    else
        fun=ve+c+rev(ve)+ve2+c2+rev(ve2)+ve+rev(c)+rev(ve)+ve2+rev(c2)+rev(ve2);
    return boring+fun+rev(boring);
}

Compilation message

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

Subtask #1
1.75 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15704 KB Output is correct
2 Partially correct 5 ms 15964 KB Output is partially correct
3 Correct 7 ms 15708 KB Output is correct
4 Correct 5 ms 15708 KB Output is correct
5 Correct 5 ms 15708 KB Output is correct
6 Partially correct 4 ms 15964 KB Output is partially correct
7 Partially correct 45 ms 23176 KB Output is partially correct

Subtask #2
1.75 / 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 Partially correct 5 ms 15960 KB Output is partially correct
4 Partially correct 4 ms 15960 KB Output is partially correct
5 Partially correct 5 ms 16048 KB Output is partially correct
6 Partially correct 29 ms 22232 KB Output is partially correct

Subtask #3
7.35 / 21.0

# Verdict Execution time Memory Grader output
1 Partially correct 6 ms 16216 KB Output is partially correct
2 Correct 4 ms 15708 KB Output is correct
3 Correct 5 ms 15708 KB Output is correct
4 Partially correct 5 ms 15960 KB Output is partially correct
5 Correct 8 ms 15964 KB Output is correct
6 Partially correct 6 ms 15964 KB Output is partially correct
7 Correct 5 ms 15844 KB Output is correct
8 Partially correct 7 ms 15964 KB Output is partially correct
9 Partially correct 5 ms 15964 KB Output is partially correct
10 Partially correct 5 ms 16216 KB Output is partially correct
11 Partially correct 7 ms 15964 KB Output is partially correct
12 Partially correct 8 ms 16220 KB Output is partially correct
13 Correct 7 ms 15960 KB Output is correct
14 Correct 6 ms 15708 KB Output is correct
15 Partially correct 7 ms 15964 KB Output is partially correct
16 Correct 6 ms 15708 KB Output is correct
17 Partially correct 24 ms 20060 KB Output is partially correct
18 Correct 21 ms 19804 KB Output is correct
19 Correct 5 ms 15844 KB Output is correct
20 Partially correct 5 ms 15964 KB Output is partially correct
21 Partially correct 6 ms 15964 KB Output is partially correct
22 Partially correct 5 ms 15964 KB Output is partially correct
23 Partially correct 32 ms 22216 KB Output is partially correct

Subtask #4
8.4 / 24.0

# Verdict Execution time Memory Grader output
1 Partially correct 5 ms 16092 KB Output is partially correct
2 Correct 6 ms 16232 KB Output is correct
3 Correct 38 ms 22368 KB Output is correct
4 Partially correct 35 ms 22500 KB Output is partially correct
5 Partially correct 8 ms 16220 KB Output is partially correct
6 Partially correct 6 ms 16220 KB Output is partially correct
7 Partially correct 4 ms 15852 KB Output is partially correct
8 Correct 5 ms 15964 KB Output is correct
9 Correct 5 ms 15964 KB Output is correct
10 Correct 7 ms 16096 KB Output is correct
11 Correct 6 ms 15964 KB Output is correct
12 Correct 7 ms 16108 KB Output is correct
13 Partially correct 7 ms 16216 KB Output is partially correct
14 Partially correct 8 ms 16220 KB Output is partially correct
15 Correct 6 ms 16220 KB Output is correct
16 Correct 6 ms 16220 KB Output is correct
17 Correct 5 ms 15708 KB Output is correct
18 Correct 6 ms 16100 KB Output is correct
19 Correct 5 ms 15984 KB Output is correct
20 Correct 34 ms 22872 KB Output is correct
21 Partially correct 33 ms 22352 KB Output is partially correct
22 Correct 6 ms 15976 KB Output is correct
23 Correct 7 ms 15708 KB Output is correct
24 Correct 4 ms 15708 KB Output is correct
25 Correct 6 ms 15964 KB Output is correct
26 Correct 5 ms 16216 KB Output is correct
27 Partially correct 36 ms 22864 KB Output is partially correct
28 Correct 38 ms 22992 KB Output is correct
29 Correct 7 ms 15708 KB Output is correct
30 Correct 37 ms 23320 KB Output is correct
31 Correct 7 ms 15964 KB Output is correct
32 Correct 42 ms 22844 KB Output is correct
33 Correct 33 ms 22616 KB Output is correct
34 Correct 23 ms 19988 KB Output is correct
35 Correct 5 ms 16216 KB Output is correct
36 Correct 30 ms 21876 KB Output is correct
37 Correct 48 ms 23504 KB Output is correct
38 Correct 5 ms 15704 KB Output is correct
39 Correct 40 ms 21584 KB Output is correct
40 Correct 6 ms 16220 KB Output is correct
41 Correct 34 ms 23132 KB Output is correct
42 Correct 35 ms 22876 KB Output is correct
43 Correct 5 ms 15704 KB Output is correct
44 Correct 8 ms 15964 KB Output is correct
45 Correct 6 ms 16220 KB Output is correct
46 Correct 19 ms 19544 KB Output is correct

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15704 KB Output is correct
2 Partially correct 5 ms 15964 KB Output is partially correct
3 Correct 7 ms 15708 KB Output is correct
4 Correct 5 ms 15708 KB Output is correct
5 Correct 5 ms 15708 KB Output is correct
6 Partially correct 4 ms 15964 KB Output is partially correct
7 Partially correct 45 ms 23176 KB Output is partially correct
8 Correct 5 ms 15960 KB Output is correct
9 Correct 5 ms 15708 KB Output is correct
10 Partially correct 5 ms 15960 KB Output is partially correct
11 Partially correct 4 ms 15960 KB Output is partially correct
12 Partially correct 5 ms 16048 KB Output is partially correct
13 Partially correct 29 ms 22232 KB Output is partially correct
14 Partially correct 6 ms 16216 KB Output is partially correct
15 Correct 4 ms 15708 KB Output is correct
16 Correct 5 ms 15708 KB Output is correct
17 Partially correct 5 ms 15960 KB Output is partially correct
18 Correct 8 ms 15964 KB Output is correct
19 Partially correct 6 ms 15964 KB Output is partially correct
20 Correct 5 ms 15844 KB Output is correct
21 Partially correct 7 ms 15964 KB Output is partially correct
22 Partially correct 5 ms 15964 KB Output is partially correct
23 Partially correct 5 ms 16216 KB Output is partially correct
24 Partially correct 7 ms 15964 KB Output is partially correct
25 Partially correct 8 ms 16220 KB Output is partially correct
26 Correct 7 ms 15960 KB Output is correct
27 Correct 6 ms 15708 KB Output is correct
28 Partially correct 7 ms 15964 KB Output is partially correct
29 Correct 6 ms 15708 KB Output is correct
30 Partially correct 24 ms 20060 KB Output is partially correct
31 Correct 21 ms 19804 KB Output is correct
32 Correct 5 ms 15844 KB Output is correct
33 Partially correct 5 ms 15964 KB Output is partially correct
34 Partially correct 6 ms 15964 KB Output is partially correct
35 Partially correct 5 ms 15964 KB Output is partially correct
36 Partially correct 32 ms 22216 KB Output is partially correct
37 Correct 6 ms 15960 KB Output is correct
38 Correct 5 ms 15704 KB Output is correct
39 Correct 6 ms 15708 KB Output is correct
40 Correct 5 ms 15708 KB Output is correct
41 Correct 17 ms 18780 KB Output is correct
42 Correct 6 ms 15960 KB Output is correct
43 Runtime error 55 ms 48620 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -