Submission #1238963

#TimeUsernameProblemLanguageResultExecution timeMemory
1238963PlayVoltzKocka (COCI18_kocka)C++20
70 / 70
26 ms1864 KiB
#include <cstdio> #include <stdio.h> #include <stdbool.h> #include <iostream> #include <map> #include <vector> #include <climits> #include <stack> #include <string> #include <queue> #include <algorithm> #include <set> #include <unordered_set> #include <unordered_map> #include <cmath> #include <cctype> #include <bitset> #include <iomanip> #include <cstring> #include <numeric> #include <cassert> #include <random> #include <chrono> #include <fstream> using namespace std; #define int long long #define pii pair<int, int> #define mp make_pair #define pb push_back #define fi first #define se second int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; vector<int> a(n), b(n); for (int i=0; i<n; ++i)cin>>a[i]; for (int i=0; i<n; ++i)cin>>b[i]; bool can=1; for (int i=0; i<n; ++i)if ((a[i]==-1)^(b[i]==-1)||a[i]+b[i]>=n)can=0; for (int i=0; i<n; ++i)cin>>a[i]; for (int i=0; i<n; ++i)cin>>b[i]; for (int i=0; i<n; ++i)if ((a[i]==-1)^(b[i]==-1)||a[i]+b[i]>=n)can=0; cout<<(can?"DA":"NE"); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...