제출 #164762

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
164762	2019-11-23 08:34:31	maruii	Meetings (JOI19_meetings)	C++14	29 / 100	241 ms	1144 KiB

meetings

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> edge[2001];
int deg[301], vis[301];
void dfs(int x) {
  vis[x] = 1;
  for (auto i : edge[x]) deg[i]--;
  for (auto i : edge[x]) {
    if (deg[i] == 0 && vis[i] == 0) {
      Bridge(min(x, i), max(x, i));
      dfs(i);
    }
  }
}
  
void Solve(int N) {
  if (N > 300) assert(0);
  for (int i = 1; i < N; ++i) {
    edge[0].push_back(i);
    for (int j = i + 1; j < N; ++j) {
      int x = Query(0, i, j);
      if (x != j) edge[x].push_back(j);
      if (x != i) edge[x].push_back(i);
    }
  }
  for (int i = 0; i < N; ++i) {
    sort(edge[i].begin(), edge[i].end());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 7 / 7
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 0 / 71