제출 #701703

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
701703		scottchou	Kocka (COCI18_kocka)	C++17	70 / 70	315 ms	51160 KiB

kocka

#include<bits/stdc++.h>
using namespace std;
int const N = 1e5 + 5;
int l[N], r[N], top[N], bottom[N];
set<int> x[N], y[N];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> l[i];
        if(l[i] >= 0){
            x[i].insert(l[i] + 1);
            y[l[i] + 1].insert(i);
        }
    }
    for(int i = 1; i <= n; i++){
        cin >> r[i];
        if(r[i] >= 0){
            x[i].insert(n - r[i]);
            y[n - r[i]].insert(i);
        }
    }
    for(int i = 1; i <= n; i++){
        cin >> top[i];
        if(top[i] >= 0){
            x[top[i] + 1].insert(i);
            y[i].insert(top[i] + 1);
        }
    }
    for(int i = 1; i <= n; i++){
        cin >> bottom[i];
        if(bottom[i] >= 0){
            x[n - bottom[i]].insert(i);
            y[i].insert(n - bottom[i]);
        }
    }
    bool can = 1;
    for(int i = 1; i <= n; i++){
        if(l[i] == -1 && !x[i].empty())
            can = 0;
        if(r[i] == -1 && !x[i].empty())
            can = 0;
        if(top[i] == -1 && !y[i].empty())
            can = 0;
        if(bottom[i]== -1 && !y[i].empty())
            can = 0;
        if(!can)
            break;
        if((l[i] >= 0 && *x[i].begin() != l[i] + 1) || (r[i] >= 0 && *prev(x[i].end()) != n - r[i]) || (top[i] >= 0 && *y[i].begin() != top[i] + 1) || (bottom[i] >= 0 && *prev(y[i].end()) != n - bottom[i])){
            can = 0;
            break;
        }
    }
    if(can){
        cout << "DA\n";
    }else{
        cout << "NE\n";
    }
}

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