제출 #704345

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
704345	2023-03-02 04:01:58	vjudge1	Park (JOI17_park)	C++17	100 / 100	442 ms	668 KiB

park

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 <bits/stdc++.h>
using namespace std;
#ifndef hollwo_pelw_local
# include "park.h"
#else
  namespace {
  #define NMAX  1400
  #define DMAX  7
  #define QMAX  45000
  static int T,N,M,Asktotal,Answertotal;
  static int edge_list[NMAX][DMAX];
  static int checked[NMAX][DMAX];
  static int degree[NMAX];
  static int visited[NMAX];
  }
  static void WA(int wa_num) {
    printf("Wrong Answer[%d]\n",wa_num);
    exit(0);
  }
  void Detect(int T, int N);
  void Answer(int A, int B) {
    int i;
    // cout << "! " << A << ' ' << B << '\n';
    if(A < 0||A >= B||B >= N) WA(1);
    for(i = 0 ; i < degree[A] ; i++) {
      if(edge_list[A][i] == B) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 27 / 27
• Subtask 4: 30 / 30
• Subtask 5: 23 / 23