제출 #746334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
746334		math_rabbit_1028	수천개의 섬 (IOI22_islands)	C++17	10.15 / 100	100 ms	14296 KiB

islands

#include "islands.h"

#include <bits/stdc++.h>
using namespace std;

bool ans = false;

int n, m;
vector< pair<int, int> > adj[101010], rev[101010];
int out[101010], remain[202020];

set< pair<int, int> > outset;

int ch[202020];
void DFS(int v) {
  //cout << v << "\n";
  int cnt = 0;
  for (int i = 0; i < adj[v].size(); i++) {
    if (remain[adj[v][i].second] == 0) continue;
    if (ch[adj[v][i].second] == 0) {
      cnt++;
    }
  }
  if (cnt >= 2) {
    ans = true;
    return;
  }
  for (int i = 0; i < adj[v].size(); i++) {
    if (remain[adj[v][i].second] == 0) continue;
    if (ch[adj[v][i].second] == 0) {
      ch[adj[v][i].second] = 1;
      DFS(adj[v][i].first);
    }
  }
}

std::variant<bool, std::vector<int>> find_journey(
    int N, int M, std::vector<int> U, std::vector<int> V) {
  n = N; m = M;
  for (int i = 0; i < m; i++) {
    adj[U[i]].push_back({V[i], i});
    rev[V[i]].push_back({U[i], i});
    out[U[i]]++;
    remain[i] = 1;
  }

  for (int i = 0; i < n; i++) outset.insert({out[i], i});
  while (!outset.empty() && outset.begin()->first == 0) {
    int v = outset.begin()->second;
    outset.erase(outset.begin());
    for (int i = 0; i < rev[v].size(); i++) {
      if (remain[rev[v][i].second] == 0) continue;
      remain[rev[v][i].second] = 0;
      outset.erase(outset.find(make_pair(out[rev[v][i].first], rev[v][i].first)));
      out[rev[v][i].first]--;
      outset.insert(make_pair(out[rev[v][i].first], rev[v][i].first));
    }
  }

  //for (int i = 0; i < m; i++) cout << remain[i] << "\n";
  //cout << "\n";

  DFS(0);

  return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

islands.cpp: In function 'void DFS(int)':
islands.cpp:18:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |   for (int i = 0; i < adj[v].size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~
islands.cpp:28:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |   for (int i = 0; i < adj[v].size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~
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:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for (int i = 0; i < rev[v].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 1.75 / 5
• Subtask 3: 0 / 21
• Subtask 4: 8.399999999999999 / 24
• Subtask 5: 0 / 45