제출 #1306850

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1306850		KickingKun	Meetings (JOI19_meetings)	C++20	17 / 100	1262 ms	106284 KiB

meetings

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

const int MAXN = 300;
int save[MAXN][MAXN][MAXN];

int get(int a, int b, int c) {
  if (a > b) swap(a, b);
  if (a > c) swap(a, c);
  if (b > c) swap(b, c);

  if (save[a][b][c] != -1) return save[a][b][c];
  return save[a][b][c] = Query(a, b, c);
}

void Solve(int n) {
  memset(save, -1, sizeof save);

  for (int u = 0; u < n; u++) {
    for (int v = u + 1; v < n; v++) {
      bool isEdge = true;
      for (int w = 0; w < n && isEdge; w++) if (u != w && v != w) {
        if (get(u, v, w) == w) isEdge = false;
      }
      if (isEdge) Bridge(u, v);
    }
  }
}

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