oj.uz

답안 #437675

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
437675 2021-06-26T20:06:09 Z xiaowuc1 Pipes (CEOI15_pipes) C++17
90 / 100
 1525 ms 22188 KB 
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
// END NO SAD

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;

int find(vector<int>& p, int x) {
  return p[x] == x ? x : (p[x] = find(p, p[x]));
}
bool merge(vector<int>& p, int x, int y) {
  x = find(p, x);
  y = find(p, y);
  if(x == y) return false;
  p[x] = y;
  return true;
}

bool visited[100005];
vector<int> edges[100005];
int aptime = 1;
int discTime[100005];
int low[100005];
int parv[100005];

void dfsForAP(int curr, int parent) {
  visited[curr] = true;
  int numchild = 0;
  discTime[curr] = low[curr] = ++aptime;
  sort(all(edges[curr]));
  for(int i = 0; i < sz(edges[curr]); ) {
    int out = edges[curr][i];
    bool dup = i+1 < sz(edges[curr]) && edges[curr][i] == edges[curr][i+1];
    if(!visited[out]) {
      numchild++;
      parv[out] = curr;
      dfsForAP(out, curr);
      low[curr] = min(low[curr], low[out]);
      if(!dup && low[out] > discTime[curr]) {
        cout << curr << " " << out << "\n";
      }
    }
    else if(out != parv[curr]) {
      low[curr] = min(low[curr], discTime[out]);
    }
    if(dup) i += 2;
    else i++;
  }
}

void solve() {
  int n, m;
  cin >> n >> m;
  {
    vector<int> p1(n+1);
    vector<int> p2(n+1);
    iota(all(p1), 0);
    iota(all(p2), 0);
    while(m--) {
      int a, b;
      cin >> a >> b;
      if(merge(p1, a, b)) {
        edges[a].pb(b);
        edges[b].pb(a);
      } 
      else if(merge(p2, a, b)) {
        edges[a].pb(b);
        edges[b].pb(a);
      }
    }
  }
  for(int i = 1; i <= n; i++) {
    if(visited[i]) continue;
    dfsForAP(i, -1);
  }
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  solve();
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3148 KB Output is correct
2 Correct 6 ms 2892 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 2968 KB Output is correct
2 Correct 132 ms 2824 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 218 ms 3644 KB Output is correct
2 Correct 259 ms 3260 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 381 ms 5208 KB Output is correct
2 Correct 293 ms 5032 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 551 ms 9732 KB Output is correct
2 Correct 484 ms 6772 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 789 ms 11044 KB Output is correct
2 Correct 713 ms 8340 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1084 ms 12872 KB Output is correct
2 Correct 966 ms 8712 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1230 ms 12816 KB Output is correct
2 Correct 1234 ms 8736 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1525 ms 12360 KB Output is correct
2 Runtime error 1460 ms 22188 KB Memory limit exceeded