oj.uz

답안 #630706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
630706 2022-08-16T23:47:08 Z DanerZein 수천개의 섬 (IOI22_islands) C++17
1.75 / 100
 32 ms 5288 KB 
#include "islands.h"
#include <bits/stdc++.h>
#include <variant>
#include <vector>
using namespace std;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int MAX_N=1010;
const int MAX_M=2e5+10;
vector<vii> G;
bool vis[MAX_N];
bool usa[MAX_M];
void dfs(int u){
  vis[u]=1;
  for(auto &v:G[u]){
    if(!vis[v.first]){
      usa[v.second]=1;
      dfs(v.first);
    }
  }
}
std::variant<bool, std::vector<int>> find_journey(
    int N, int M, std::vector<int> U, std::vector<int> V) {
  G.resize(N+1);
  for(int i=0;i<M;i+=2){
    G[U[i]].push_back(ii(V[i],i/2));
    G[U[i+1]].push_back(ii(V[i+1],i/2));
  }
  memset(vis,0,sizeof vis);
  dfs(0);
  bool ci=0;
  for(int i=0;i<N;i++){
    if(vis[i]){
      for(auto &v:G[i]){
	if(vis[v.first] && !usa[v.second]){
	  ci=1;
	  break;
	}
      }
    }
    if(ci) break;
  }
  if(ci || G[0].size()>=2) return true;
  return false;
}

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
1.75 / 5.0

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

Subtask #3
0.0 / 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 1 ms 340 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 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 212 KB Output is partially correct
2 Partially correct 1 ms 340 KB Output is partially correct
3 Partially correct 29 ms 5044 KB Output is partially correct
4 Partially correct 32 ms 5288 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 Partially correct 1 ms 212 KB Output is partially 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 340 KB Output is partially correct
11 Incorrect 2 ms 340 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -