This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
bool moze=true;
int n;
vector<vector<int> > polje;
int main(){
cin>>n;
vector<int> pom;
for(int i=0;i<n;i++){
polje.push_back(pom);
int a;
cin>>a;
if(a==-1){
polje[i].insert(polje[i].begin(),n,0);
}else if(a==0){
polje[i].push_back(1);
polje[i].insert(polje[i].begin()+1,n-1,-1);
}else{
polje[i].insert(polje[i].begin(),a,0);
polje[i].push_back(1);
polje[i].insert(polje[i].begin()+a,n-a-1,-1);
}
}
for(int i=0;i<n;i++){
int a;
cin>>a;
if(a==-1){
if(polje[i][n-1]!=0){
moze=false;
}
}else if(a==0){
if(polje[i][n-1]==0){
moze=false;
}
polje[i][n-1]=1;
}else{
for(int k=n-1;k>n-a-1;k--){
if(polje[i][k]==1){
moze=false;
}
polje[i][k]=0;
}
if(polje[i][n-a-1]==0){
moze=false;
}
polje[i][n-a-1]=1;
}
}
for(int i=0;i<n;i++){
int a;
cin>>a;
if(a==-1){
if(polje[0][i]!=0){
moze=false;
}
}else if(a==0){
if(polje[0][i]==0){
moze=false;
}
polje[0][i]=1;
}else{
for(int k=0;k>a;k++){
if(polje[k][i]==1){
moze=false;
}
polje[k][i]=0;
}
if(polje[a][i]==0){
moze=false;
}
polje[a][i]=1;
}
}
for(int i=0;i<n;i++){
int a;
cin>>a;
if(a==-1){
if(polje[n-1][i]!=0){
moze=false;
}
}else if(a==0){
if(polje[n-1][i]==0){
moze=false;
}
polje[n-1][i]=1;
}else{
for(int k=n-1;k>n-a-1;k--){
if(polje[k][i]==1){
moze=false;
}
polje[k][i]=0;
}
if(polje[n-a-1][i]==0){
moze=false;
}
polje[n-a-1][i]=1;
}
}
if(moze)cout<<"DA";
else cout<<"NE";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |