# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
640909 | andreast12 | Kocka (COCI18_kocka) | C++17 | 44 ms | 5756 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;
#define ll long long
#define fi first
#define se second
#define pb push_back
const int mod=998244353, maxn=1e5+5;
int n, a[10][maxn], ki, ka, atas, bwh, kolmin[maxn], kolmax[maxn];
bool ans=true;
pair<int, int> baris[maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin >> n;
for(int i=1; i<=4; i++) {
for(int j=1; j<=n; j++) cin >> a[i][j];
}
for(int i=0; i<=n; i++) kolmin[i]=mod, kolmax[i]=-1;
for(int i=1; i<=n; i++) {
if(((a[1][i]==-1)^(a[2][i]==-1))||a[1][i]+a[2][i]+1>n) ans=false;
if(a[1][i]==-1&&a[2][i]==-1) {
baris[i]={-1, -1};
} else {
ki=a[1][i]+1, ka=n-a[2][i];
baris[i]={ki, ka};
kolmin[ki]=min(kolmin[ki], i);
kolmax[ki]=max(kolmax[ki], i);
kolmin[ka]=min(kolmin[ka], i);
kolmax[ka]=max(kolmax[ka], 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... |