제출 #286209

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
286209	2020-08-30 08:25:03	user202729	장난감 기차 (IOI17_train)	C++17	10 / 100	11 ms	896 KiB

train

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
// moreflags=grader.cpp
//
// 13
// still unproven.
// 
#include "train.h"
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
  if(a.size()>15) return {};
  std::vector<int> adjacent(a.size());
  for(int index=0; index<(int)u.size(); ++index){
    adjacent[u[index]]|=1<<v[index];
  }
  int noChargeMask=0;
  for(int node=0; node<(int)r.size(); ++node)
    if(not r[node])
      noChargeMask|=1<<node;
  auto const contains=[&](int large, int small){ return (large&small)==small; };
  int bwin{};
  for(int _=0; _<(int)a.size()+1; ++_){
    for(int mask=noChargeMask; mask; mask=(mask-1)&noChargeMask){
      for(int node=0; node<(int)a.size(); ++node)
        if(mask>>node&1){
          if(a[node]){
            if(not contains(mask|bwin, adjacent[node]))
              goto next_mask;
          }else{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 12
• Subtask 6: 0 / 51