# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234656 | super_j6 | Kocka (COCI18_kocka) | C++14 | 55 ms | 2680 KiB |
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 <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
const int maxn = 100000;
int n;
int a[4][maxn];
int s[maxn];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int t = 0; t < 4; t++)
for(int i = 0; i < n; i++){
cin >> a[t][i];
}
for(int tt = 0; tt < 4; tt++){
if(tt < 2) for(int i = 0; i < n; i++){
if(a[0][i] + a[1][i] >= n || !~a[0][i] ^ !~a[1][i]){
# | 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... |