oj.uz

답안 #796458

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796458 2023-07-28T12:04:42 Z ln_e 수천개의 섬 (IOI22_islands) C++17
25.75 / 100
 43 ms 5188 KB 
      #include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
        #include "islands.h"
        using ll=long long;
        using ld=long double;
        int const INF=1000000005;
        ll const LINF=1000000000000000005;
        ll const mod=1000000007;
        ld const PI=3.14159265359;
        ll const MAX_N=3e5+5;
        ld const EPS=0.00000001;
        #pragma GCC optimize("O3")
        #pragma GCC optimize("Ofast")
        #define f first
        #define s second
        #define pb push_back
        #define mp make_pair
        #define endl '\n'
        #define sz(a) (int)a.size()
        #define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
        using namespace std;
    vector<ll>g[1005];
    map<ll,ll>viz;
        int dfs(ll node){
      viz[node]=1;
      for(auto it : g[node]){
        if(viz[it]==1){
          return 1;
        }
        if(viz[it]==0){
          if(dfs(it)){
            return 1;
          }
        }
      }
      viz[node]=2;
      return 0;
    }
    std::variant<bool, std::vector<int>> find_journey(
        int N, int M, std::vector<int> U, std::vector<int> V) {
      ll verif=1;
      for(ll i=0;i<M;i+=2){
        if(U[i]!=V[i+1]&&U[i+1]!=V[i]){
          verif=0;
        }
      }
      if (N == 2){
        vector<ll>g[3];
        for(ll i=0;i<M;i++)
        {
          g[U[i]].pb(i);
        }
        if(g[0].size()>=2&&g[1].size()>=1){
          vector<int>ans;
          ans.pb(g[0][0]);
          ans.pb(g[1][0]);
          ans.pb(g[0][1]);
          ans.pb(g[0][0]);
          ans.pb(g[1][0]);
          ans.pb(g[0][1]);
          return ans;
        }else return false;
      }else if(N<=400&&M==N*(N-1)){
        ll indx[10];
        if(N<3){
          return false;
        }
        for(ll i=0;i<M;i++){
          if(U[i]==0&&V[i]==1){
            indx[1]=i;
          }else if(U[i]==1&&V[i]==0){
            indx[2]=i;
          }else if(U[i]==1&&V[i]==2){
            indx[3]=i;
          }else if(U[i]==2&&V[i]==1){
            indx[4]=i;
          }else if(U[i]==0&&V[i]==2){
            indx[5]=i;
          }else if(U[i]==2&&V[i]==0){
            indx[6]=i;
          }
        }
        vector<int>ans;
        ans.pb(indx[1]);
        ans.pb(indx[3]);
        ans.pb(indx[4]);
        ans.pb(indx[1]);
        ans.pb(indx[5]);
        ans.pb(indx[3]);
        ans.pb(indx[4]);
        ans.pb(indx[5]);
        return ans;
      }else if(N<=1000&&verif){
        map<ll,ll>deg;
        for(ll i=0;i<M;i+=2)
        {
          g[U[i]].pb(V[i]);
          g[V[i]].pb(U[i]);
          deg[U[i]]++;
          deg[V[i]]++;
        }
        queue<ll>q;
        q.push(0);
        while(!q.empty()){
          ll x=q.front();
          q.pop();
          if(deg[x]>=3){
            return true;
          }
          for(auto it : g[x]){
            if(viz[it]==0){
              q.push(it);
              viz[it]=1;
            }
          }
        }
        return false;
      }else {
                for(ll i=0;i<M;i+=2)
        {
          g[U[i]].pb(V[i]);
        }
        ll check=dfs(0);
        for(ll i=0;i<N;i++)
        {
          g[i].clear();
        }
        for(ll i=1;i<M;i+=2){
          g[U[i]].pb(V[i]);
        }
        check|=dfs(0);
        if(check==1){
          return true;
        }else return false;
      }
      }

Compilation message

islands.cpp: In function 'std::variant<bool, std::vector<int, std::allocator<int> > > find_journey(int, int, std::vector<int>, std::vector<int>)':
islands.cpp:84:15: warning: 'indx[3]' may be used uninitialized in this function [-Wmaybe-uninitialized]
   84 |         ans.pb(indx[3]);
      |         ~~~~~~^~~~~~~~~
islands.cpp:87:15: warning: 'indx[5]' may be used uninitialized in this function [-Wmaybe-uninitialized]
   87 |         ans.pb(indx[5]);
      |         ~~~~~~^~~~~~~~~
islands.cpp:85:15: warning: 'indx[4]' may be used uninitialized in this function [-Wmaybe-uninitialized]
   85 |         ans.pb(indx[4]);
      |         ~~~~~~^~~~~~~~~
islands.cpp:83:15: warning: 'indx[1]' may be used uninitialized in this function [-Wmaybe-uninitialized]
   83 |         ans.pb(indx[1]);
      |         ~~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 28 ms 5188 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 232 KB Output is correct
6 Correct 22 ms 2748 KB Output is correct

Subtask #3
7.35 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 468 KB Output is partially correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Partially correct 0 ms 212 KB Output is partially correct
5 Correct 2 ms 468 KB Output is correct
6 Partially correct 0 ms 212 KB Output is partially correct
7 Correct 1 ms 340 KB Output is correct
8 Partially correct 1 ms 340 KB Output is partially correct
9 Partially correct 1 ms 212 KB Output is partially correct
10 Partially correct 1 ms 468 KB Output is partially correct
11 Correct 0 ms 212 KB Output is correct
12 Partially correct 1 ms 468 KB Output is partially correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Partially correct 0 ms 212 KB Output is partially correct
16 Correct 1 ms 340 KB Output is correct
17 Partially correct 20 ms 3036 KB Output is partially correct
18 Partially correct 17 ms 2756 KB Output is partially correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 21 ms 2736 KB Output is correct

Subtask #4
8.4 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 212 KB Output is partially correct
2 Partially correct 1 ms 340 KB Output is partially correct
3 Partially correct 26 ms 4172 KB Output is partially correct
4 Partially correct 27 ms 4172 KB Output is partially correct
5 Partially correct 1 ms 340 KB Output is partially correct
6 Partially correct 1 ms 340 KB Output is partially correct
7 Correct 1 ms 212 KB Output is correct
8 Partially correct 0 ms 212 KB Output is partially correct
9 Partially correct 0 ms 212 KB Output is partially correct
10 Partially correct 1 ms 468 KB Output is partially correct
11 Correct 1 ms 468 KB Output is correct
12 Partially correct 1 ms 468 KB Output is partially correct
13 Partially correct 1 ms 468 KB Output is partially correct
14 Partially correct 1 ms 340 KB Output is partially correct
15 Partially correct 1 ms 340 KB Output is partially correct
16 Partially correct 1 ms 340 KB Output is partially correct
17 Correct 1 ms 212 KB Output is correct
18 Partially correct 1 ms 340 KB Output is partially correct
19 Partially correct 1 ms 340 KB Output is partially correct
20 Correct 32 ms 4572 KB Output is correct
21 Partially correct 29 ms 4176 KB Output is partially correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Partially correct 1 ms 340 KB Output is partially correct
26 Partially correct 1 ms 468 KB Output is partially correct
27 Partially correct 28 ms 4512 KB Output is partially correct
28 Partially correct 29 ms 4784 KB Output is partially correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 43 ms 5032 KB Output is correct
31 Partially correct 1 ms 212 KB Output is partially correct
32 Partially correct 27 ms 4668 KB Output is partially correct
33 Partially correct 27 ms 4568 KB Output is partially correct
34 Partially correct 18 ms 2632 KB Output is partially correct
35 Partially correct 1 ms 340 KB Output is partially correct
36 Partially correct 31 ms 3948 KB Output is partially correct
37 Partially correct 28 ms 4872 KB Output is partially correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 28 ms 3844 KB Output is correct
40 Partially correct 2 ms 340 KB Output is partially correct
41 Correct 39 ms 4932 KB Output is correct
42 Partially correct 27 ms 4644 KB Output is partially correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Partially correct 1 ms 468 KB Output is partially correct
46 Partially correct 12 ms 2260 KB Output is partially correct

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 28 ms 5188 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 232 KB Output is correct
13 Correct 22 ms 2748 KB Output is correct
14 Partially correct 1 ms 468 KB Output is partially correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Partially correct 0 ms 212 KB Output is partially correct
18 Correct 2 ms 468 KB Output is correct
19 Partially correct 0 ms 212 KB Output is partially correct
20 Correct 1 ms 340 KB Output is correct
21 Partially correct 1 ms 340 KB Output is partially correct
22 Partially correct 1 ms 212 KB Output is partially correct
23 Partially correct 1 ms 468 KB Output is partially correct
24 Correct 0 ms 212 KB Output is correct
25 Partially correct 1 ms 468 KB Output is partially correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Partially correct 0 ms 212 KB Output is partially correct
29 Correct 1 ms 340 KB Output is correct
30 Partially correct 20 ms 3036 KB Output is partially correct
31 Partially correct 17 ms 2756 KB Output is partially correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 21 ms 2736 KB Output is correct
37 Incorrect 1 ms 212 KB Output isn't correct
38 Halted 0 ms 0 KB -