oj.uz

답안 #292684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
292684 2020-09-07T11:44:54 Z Haunted_Cpp Simurgh (IOI17_simurgh) C++17
30 / 100
 3000 ms 4864 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 240 + 5;


vector<vector<pair<int, int>>> g(MAX_N);
bitset<MAX_N> vis;

vector<int> span, par, s, best_way, u, v;

int n;

void reset() {
  for (int i = 0; i < n; i++) {
    par[i] = i;
    s[i] = 1;
  }
}

int root(int x) {
  if (x == par[x]) return x;
  return par[x] = root(par[x]);
}

void join(int a, int b) {
  a = root(a);
  b = root(b);
  if (a == b) return;
  if (s[a] < s[b]) swap(a, b);
  par[b] = a;
  s[a] += s[b];
}

bool is(int a, int b) {
  return root(a) == root(b);
}

bool works() {
  for (auto to : span) {
    const int st = u[to];
    const int et = v[to];
    if (is(st, et)) return false;
    join(st, et);
  }
  return true;
}


void get_any(int node) {
  vis[node] = 1;
  for (auto [nxt, to] : g[node]) {
    if (!vis[nxt]) {
      vis[nxt] = 1;
      span.emplace_back(to);
      get_any(nxt);
    }
  }  
}

vector<int> find_roads(int n, vector<int> u, vector<int> v) {
  ::n = n;
  ::u = u;
  ::v = v;
  const int m = v.size();
  const int t = n - 1;
  par = s = vector<int>(n);
  for (int i = 0; i < m; i++) {
    const int st = u[i];
    const int et = v[i];
    g[st].emplace_back(et, i);
    g[et].emplace_back(st, i);
  }
  get_any(0);
  int score = count_common_roads(span);
  if (score == t) {
    return span;
  }
  for (auto &edge : span) {
    int starting_edge = edge;
    bool swap = false;
    for (int i = 0; i < m; i++) {
      reset();
      edge = i;
      if(!works()) {
        continue;
      }
      int nxt_score = count_common_roads(span);
      if (nxt_score > score) {
        score = nxt_score;
        assert(edge == i);
        swap = true;
        break;
      }
    }
    if (score == t) {
      return span;
    }
    if (!swap) {
      edge = starting_edge;
    }
  }
  return span;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB correct
2 Correct 0 ms 384 KB correct
3 Correct 1 ms 384 KB correct
4 Correct 1 ms 384 KB correct
5 Correct 1 ms 384 KB correct
6 Correct 1 ms 384 KB correct
7 Correct 0 ms 384 KB correct
8 Correct 1 ms 384 KB correct
9 Correct 0 ms 384 KB correct
10 Correct 0 ms 384 KB correct
11 Correct 1 ms 384 KB correct
12 Correct 1 ms 416 KB correct
13 Correct 1 ms 384 KB correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB correct
2 Correct 0 ms 384 KB correct
3 Correct 1 ms 384 KB correct
4 Correct 1 ms 384 KB correct
5 Correct 1 ms 384 KB correct
6 Correct 1 ms 384 KB correct
7 Correct 0 ms 384 KB correct
8 Correct 1 ms 384 KB correct
9 Correct 0 ms 384 KB correct
10 Correct 0 ms 384 KB correct
11 Correct 1 ms 384 KB correct
12 Correct 1 ms 416 KB correct
13 Correct 1 ms 384 KB correct
14 Correct 34 ms 440 KB correct
15 Correct 24 ms 444 KB correct
16 Correct 31 ms 384 KB correct
17 Correct 32 ms 384 KB correct
18 Correct 14 ms 384 KB correct
19 Correct 35 ms 384 KB correct
20 Correct 25 ms 384 KB correct
21 Correct 31 ms 384 KB correct
22 Correct 23 ms 384 KB correct
23 Correct 21 ms 384 KB correct
24 Correct 24 ms 384 KB correct
25 Correct 3 ms 384 KB correct
26 Correct 21 ms 384 KB correct
27 Correct 21 ms 384 KB correct
28 Correct 10 ms 384 KB correct
29 Correct 6 ms 384 KB correct
30 Correct 26 ms 384 KB correct
31 Correct 27 ms 384 KB correct
32 Correct 29 ms 384 KB correct
33 Correct 23 ms 384 KB correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB correct
2 Correct 0 ms 384 KB correct
3 Correct 1 ms 384 KB correct
4 Correct 1 ms 384 KB correct
5 Correct 1 ms 384 KB correct
6 Correct 1 ms 384 KB correct
7 Correct 0 ms 384 KB correct
8 Correct 1 ms 384 KB correct
9 Correct 0 ms 384 KB correct
10 Correct 0 ms 384 KB correct
11 Correct 1 ms 384 KB correct
12 Correct 1 ms 416 KB correct
13 Correct 1 ms 384 KB correct
14 Correct 34 ms 440 KB correct
15 Correct 24 ms 444 KB correct
16 Correct 31 ms 384 KB correct
17 Correct 32 ms 384 KB correct
18 Correct 14 ms 384 KB correct
19 Correct 35 ms 384 KB correct
20 Correct 25 ms 384 KB correct
21 Correct 31 ms 384 KB correct
22 Correct 23 ms 384 KB correct
23 Correct 21 ms 384 KB correct
24 Correct 24 ms 384 KB correct
25 Correct 3 ms 384 KB correct
26 Correct 21 ms 384 KB correct
27 Correct 21 ms 384 KB correct
28 Correct 10 ms 384 KB correct
29 Correct 6 ms 384 KB correct
30 Correct 26 ms 384 KB correct
31 Correct 27 ms 384 KB correct
32 Correct 29 ms 384 KB correct
33 Correct 23 ms 384 KB correct
34 Execution timed out 3069 ms 1792 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB correct
2 Correct 1 ms 384 KB correct
3 Runtime error 22 ms 4864 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB correct
2 Correct 0 ms 384 KB correct
3 Correct 1 ms 384 KB correct
4 Correct 1 ms 384 KB correct
5 Correct 1 ms 384 KB correct
6 Correct 1 ms 384 KB correct
7 Correct 0 ms 384 KB correct
8 Correct 1 ms 384 KB correct
9 Correct 0 ms 384 KB correct
10 Correct 0 ms 384 KB correct
11 Correct 1 ms 384 KB correct
12 Correct 1 ms 416 KB correct
13 Correct 1 ms 384 KB correct
14 Correct 34 ms 440 KB correct
15 Correct 24 ms 444 KB correct
16 Correct 31 ms 384 KB correct
17 Correct 32 ms 384 KB correct
18 Correct 14 ms 384 KB correct
19 Correct 35 ms 384 KB correct
20 Correct 25 ms 384 KB correct
21 Correct 31 ms 384 KB correct
22 Correct 23 ms 384 KB correct
23 Correct 21 ms 384 KB correct
24 Correct 24 ms 384 KB correct
25 Correct 3 ms 384 KB correct
26 Correct 21 ms 384 KB correct
27 Correct 21 ms 384 KB correct
28 Correct 10 ms 384 KB correct
29 Correct 6 ms 384 KB correct
30 Correct 26 ms 384 KB correct
31 Correct 27 ms 384 KB correct
32 Correct 29 ms 384 KB correct
33 Correct 23 ms 384 KB correct
34 Execution timed out 3069 ms 1792 KB Time limit exceeded
35 Halted 0 ms 0 KB -