| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 146086 | youssan_william | Kocka (COCI18_kocka) | C++14 | 225 ms | 3524 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    int n;
    cin >> n;
    int arr[4][n];
    int a[n] , b[n];
    bool tillNowOk=true;
    for(int i = 0 ; i <2 ;i++)
    {
        for(int j= 0 ; j < n ;j++)
        {
            cin >> a[j];
        }
        for(int j= 0 ; j < n ;j++)
        {
            cin >> b[j];
            if(a[j]==-1&&b[j]==-1)
                continue;
            if(a[j]==-1&&b[j]!=-1)
            {
                tillNowOk=false;
            }
            if(b[j]==-1&&a[j]!=-1)
            {
                tillNowOk=false;
            }
            if(a[i]+b[i]<n)
            {
                continue;
            }
            else
            {
                tillNowOk=false;
            }
        }
    }
    if(!tillNowOk)
    {
        cout << "NE\n";
        return 0;
    }
    cout << "DA\n";
    return 0;
}
Compilation message (stderr)
| # | 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... | ||||
