oj.uz

Submission #968555

# Submission time Handle Problem Language Result Execution time Memory
968555 2024-04-23T15:33:23 Z AdamGS Thousands Islands (IOI22_islands) C++17
3.5 / 100
 34 ms 12920 KB 
#include "islands.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=2e5+7;
vector<pair<int,int>>V[LIM];
vector<int>cykl;
int odw[LIM], czy[LIM];
int DFS(int x) {
  odw[x]=1;
  for(auto i : V[x]) if(odw[i.st]) {
    czy[i.nd]=1;
    cykl.pb(i.nd);
    return i.st;
  }
  for(auto i : V[x]) {
    if(!odw[i.st]) {
      int p=DFS(i.st);
      if(p==-1) continue;
      if(p>=0) cykl.pb(i.nd);
      if(p==x) p=-2;
      return p;
    }
  }
  return -1;
}
variant<bool,vector<int>>find_journey(int n, int m, vector<int>X, vector<int>Y) {
  rep(i, m) V[X[i]].pb({Y[i], i});
  if(DFS(0)==-1) return false;
  rep(i, n) V[i].clear();
  for(auto i : cykl) swap(X[i], Y[i]);
  rep(i, m) if(!czy[i]) V[X[i]].pb({Y[i], i});
  if(DFS(0)==-1) return false;
  return true;
}

Subtask #1
1.75 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Partially correct 2 ms 6524 KB Output is partially correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Partially correct 2 ms 6492 KB Output is partially correct
7 Partially correct 31 ms 11984 KB Output is partially correct

Subtask #2
1.75 / 5.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 6492 KB Output is partially correct
2 Correct 2 ms 6492 KB Output is correct
3 Partially correct 2 ms 6488 KB Output is partially correct
4 Partially correct 2 ms 6488 KB Output is partially correct
5 Partially correct 2 ms 6492 KB Output is partially correct
6 Partially correct 28 ms 11984 KB Output is partially correct

Subtask #3
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 6740 KB Output is partially correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Incorrect 2 ms 6528 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 6492 KB Output is partially correct
2 Partially correct 3 ms 6492 KB Output is partially correct
3 Partially correct 27 ms 12120 KB Output is partially correct
4 Partially correct 34 ms 12920 KB Output is partially correct
5 Partially correct 2 ms 6492 KB Output is partially correct
6 Partially correct 2 ms 6488 KB Output is partially correct
7 Partially correct 2 ms 6492 KB Output is partially correct
8 Partially correct 2 ms 6444 KB Output is partially correct
9 Partially correct 2 ms 6492 KB Output is partially correct
10 Partially correct 2 ms 6488 KB Output is partially correct
11 Incorrect 2 ms 6492 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Partially correct 2 ms 6524 KB Output is partially correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Partially correct 2 ms 6492 KB Output is partially correct
7 Partially correct 31 ms 11984 KB Output is partially correct
8 Partially correct 2 ms 6492 KB Output is partially correct
9 Correct 2 ms 6492 KB Output is correct
10 Partially correct 2 ms 6488 KB Output is partially correct
11 Partially correct 2 ms 6488 KB Output is partially correct
12 Partially correct 2 ms 6492 KB Output is partially correct
13 Partially correct 28 ms 11984 KB Output is partially correct
14 Partially correct 2 ms 6740 KB Output is partially correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Incorrect 2 ms 6528 KB Output isn't correct
18 Halted 0 ms 0 KB -