제출 #170329

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
170329	2019-12-24 20:05:45	ngmh	Kocka (COCI18_kocka)	C++11	70 / 70	211 ms	5880 KiB

kocka

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;
long long s, a[5][100000];
void fail(){
  cout << "NE";
  exit(0);
}
int main(){
  cin >> s;
  if(s == 3) fail();
  for(int i = 0; i < 4; i++){
    for(int j = 0; j < s; j++) cin >> a[i][j];
  }
  for(int i = 0; i < s; i++){
    if(a[0][i] == -1 && a[1][i] != -1) fail();
    if(a[1][i] == -1 && a[0][i] != -1) fail();
    if(a[0][i] == 0 && a[1][i] == 0) continue;
    if(a[0][i] == s-1 && a[1][i] != 0) fail();
    if(a[1][i] == s-1 && a[0][i] != 0) fail();
  }
  for(int i = 0; i < s; i++){
    if(a[2][i] == -1 && a[3][i] != -1) fail();
    if(a[3][i] == -1 && a[3][i] != -1) fail();
    if(a[2][i] == -1 && a[3][i] == 0) continue;
    if(a[2][i] == s-1 && a[3][i] != 0) fail();
    if(a[3][i] == s-1 && a[2][i] != 0) fail();
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14