제출 #96466

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
96466	2019-02-09 14:42:19	KLPP	DEL13 (info1cup18_del13)	C++14	6 / 100	1082 ms	2428 KiB

del13

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;
int n;
bool done;
bool possible[1000000];
void DFS(int mask){
  if(possible[mask])return;
  possible[mask]=true;
  int arr[n];
  for(int i=0;i<n;i++){
    arr[i]=((mask&(1<<i))>0);
  }
  int prev[n];
  int next[n];
  prev[0]=-1;
  for(int i=1;i<n;i++){
    if(arr[i-1]==1)prev[i]=prev[i-1];
    else prev[i]=i-1;
  }
  next[n-1]=n;
  for(int i=n-2;i>-1;i--){
    if(arr[i+1]==1)next[i]=next[i+1];
    else next[i]=i+1;
  }
  /*for(int i=0;i<n;i++){
    cout<<prev[i]<<" "<<next[i]<<endl;
  }*/
  for(int i=0;i<n;i++){
    if(arr[i]==0 && prev[i]!=-1 && next[i]!=n){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 6 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 25
• Subtask 5: 0 / 30