답안 #1037357

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1037357	2024-07-28T14:53:54 Z	juicy	Meetings (JOI19_meetings)	C++17	100 / 100	420 ms	852 KB

meetings

#include <bits/stdc++.h>

#include "meetings.h"

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

const int MAX = 2e3;

int sz[MAX];
bool del[MAX];
vector<int> g[MAX];

void add(int u, int v) {
  g[u].push_back(v);
  g[v].push_back(u);
} 

void ers(int u, int v) {
  g[u].erase(find(g[u].begin(), g[u].end(), v));
  g[v].erase(find(g[v].begin(), g[v].end(), u));
}

void split(int p, int u, int z, int x) {
  ers(p, u);
  add(p, z);
  add(z, u);
  if (z != x) {
    add(z, x);
  }
}

void dfs(int u, int p) {
  sz[u] = 1;
  for (int v : g[u]) {
    if (!del[v] && v != p) {
      dfs(v, u);
      sz[u] += sz[v];
    }
  }
}

int findCen(int u, int p, int tot) {
  for (int v : g[u]) {
    if (!del[v] && v != p && sz[v] * 2 > tot) {
      return findCen(v, u, tot);
    }
  }
  return u;
}

void solve(int u, int x) {
  dfs(u, u);
  u = findCen(u, u, sz[u]);
  dfs(u, u);
  del[u] = 1;
  vector<int> cands;
  for (auto v : g[u]) {
    if (!del[v]) {
      cands.push_back(v);
    }
  }
  sort(cands.begin(), cands.end(), [&](int u, int v) {
    return sz[u] > sz[v];
  });
  for (int i = 0; i + 1 < cands.size(); i += 2) {
    int a = cands[i], b = cands[i + 1], z = Query(x, a, b);
    if (z == a || z == b) {
      solve(z, x);
      return;
    }
    if (z ^ u) {
      int y = Query(u, x, a) == u ? b : a;
      split(u, y, z, x);
      return;
    }
  }
  if (cands.size() & 1) {
    int v = cands.back(), z = Query(x, v, u);
    if (z == v) {
      solve(z, x);
      return;
    } else if (z ^ u) {
      split(u, v, z, x);
      return;
    }
  }
  add(u, x);
}

void Solve(int N) {
  add(0, 1);
  for (int i = 2; i < N; ++i) {
    if (!g[i].size()) {
      fill(del, del + N, 0);
      solve(0, i);
    }
  }
  for (int i = 0; i < N; ++i) {
    for (int j : g[i]) {
      if (i < j) {
        Bridge(i, j);
      }
    }
  }
}

Compilation message

meetings.cpp: In function 'void solve(int, int)':
meetings.cpp:71:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |   for (int i = 0; i + 1 < cands.size(); i += 2) {
      |                   ~~~~~~^~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	344 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	344 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	3 ms	344 KB	Output is correct
28	Correct	3 ms	556 KB	Output is correct
29	Correct	3 ms	344 KB	Output is correct
30	Correct	3 ms	344 KB	Output is correct
31	Correct	2 ms	344 KB	Output is correct
32	Correct	3 ms	344 KB	Output is correct
33	Correct	4 ms	560 KB	Output is correct
34	Correct	5 ms	560 KB	Output is correct
35	Correct	5 ms	344 KB	Output is correct
36	Correct	4 ms	344 KB	Output is correct
37	Correct	5 ms	580 KB	Output is correct
38	Correct	8 ms	344 KB	Output is correct
39	Correct	7 ms	600 KB	Output is correct

Subtask #4
71.0 / 71.0

#	결과	실행 시간	메모리	Grader output
1	Correct	153 ms	600 KB	Output is correct
2	Correct	146 ms	704 KB	Output is correct
3	Correct	144 ms	696 KB	Output is correct
4	Correct	148 ms	600 KB	Output is correct
5	Correct	138 ms	704 KB	Output is correct
6	Correct	125 ms	600 KB	Output is correct
7	Correct	210 ms	848 KB	Output is correct
8	Correct	239 ms	848 KB	Output is correct
9	Correct	221 ms	716 KB	Output is correct
10	Correct	210 ms	716 KB	Output is correct
11	Correct	262 ms	716 KB	Output is correct
12	Correct	197 ms	848 KB	Output is correct
13	Correct	152 ms	848 KB	Output is correct
14	Correct	194 ms	848 KB	Output is correct
15	Correct	171 ms	716 KB	Output is correct
16	Correct	187 ms	728 KB	Output is correct
17	Correct	217 ms	852 KB	Output is correct
18	Correct	166 ms	720 KB	Output is correct
19	Correct	178 ms	708 KB	Output is correct
20	Correct	205 ms	720 KB	Output is correct
21	Correct	183 ms	848 KB	Output is correct
22	Correct	168 ms	848 KB	Output is correct
23	Correct	198 ms	732 KB	Output is correct
24	Correct	177 ms	712 KB	Output is correct
25	Correct	180 ms	724 KB	Output is correct
26	Correct	190 ms	708 KB	Output is correct
27	Correct	180 ms	716 KB	Output is correct
28	Correct	255 ms	844 KB	Output is correct
29	Correct	212 ms	848 KB	Output is correct
30	Correct	224 ms	848 KB	Output is correct
31	Correct	220 ms	720 KB	Output is correct
32	Correct	420 ms	844 KB	Output is correct
33	Correct	356 ms	848 KB	Output is correct
34	Correct	2 ms	344 KB	Output is correct
35	Correct	2 ms	344 KB	Output is correct
36	Correct	2 ms	344 KB	Output is correct
37	Correct	2 ms	344 KB	Output is correct
38	Correct	2 ms	344 KB	Output is correct
39	Correct	3 ms	344 KB	Output is correct
40	Correct	3 ms	344 KB	Output is correct
41	Correct	4 ms	540 KB	Output is correct
42	Correct	4 ms	344 KB	Output is correct
43	Correct	3 ms	556 KB	Output is correct
44	Correct	5 ms	600 KB	Output is correct
45	Correct	5 ms	576 KB	Output is correct
46	Correct	5 ms	580 KB	Output is correct
47	Correct	0 ms	344 KB	Output is correct
48	Correct	0 ms	344 KB	Output is correct
49	Correct	0 ms	344 KB	Output is correct
50	Correct	0 ms	344 KB	Output is correct
51	Correct	0 ms	344 KB	Output is correct
52	Correct	0 ms	344 KB	Output is correct
53	Correct	0 ms	344 KB	Output is correct
54	Correct	0 ms	344 KB	Output is correct
55	Correct	0 ms	344 KB	Output is correct
56	Correct	0 ms	344 KB	Output is correct
57	Correct	0 ms	596 KB	Output is correct
58	Correct	1 ms	344 KB	Output is correct
59	Correct	0 ms	344 KB	Output is correct
60	Correct	0 ms	344 KB	Output is correct
61	Correct	0 ms	344 KB	Output is correct
62	Correct	0 ms	344 KB	Output is correct
63	Correct	0 ms	344 KB	Output is correct
64	Correct	0 ms	344 KB	Output is correct
65	Correct	0 ms	344 KB	Output is correct
66	Correct	1 ms	344 KB	Output is correct
67	Correct	0 ms	344 KB	Output is correct
68	Correct	0 ms	344 KB	Output is correct
69	Correct	0 ms	344 KB	Output is correct
70	Correct	0 ms	344 KB	Output is correct
71	Correct	0 ms	344 KB	Output is correct
72	Correct	0 ms	344 KB	Output is correct

답안 #1037357

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 10.0 / 10.0

Subtask #3 12.0 / 12.0

Subtask #4 71.0 / 71.0

Subtask #1
7.0 / 7.0

Subtask #2
10.0 / 10.0

Subtask #3
12.0 / 12.0

Subtask #4
71.0 / 71.0