oj.uz

Submission #89914

# Submission time Handle Problem Language Result Execution time Memory
89914 2018-12-19T04:41:06 Z psmao Kocka (COCI18_kocka) C++14
70 / 70
 122 ms 64132 KB 
#include <bits/stdc++.h>
using namespace std;

#define fo(i,s,t) for(int i = s; i <= t; ++ i)
#define fd(i,s,t) for(int i = s; i >= t; -- i)
#define bf(i,s) for(int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define VI vector<int>
#define sf scanf
#define pf printf
#define fp freopen
#define SZ(x) ((int)(x).size())
#ifdef MPS
#define D(x...) printf(x)
#else
#define D(x...)
#endif
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
const int inf = 1<<30;
const ll INF = 1ll<<60;
const db Inf = 1e20;
const db eps = 1e-9;

void gmax(int &a,int b){a = (a > b ? a : b);}
void gmin(int &a,int b){a = (a < b ? a : b);}

const int maxn = 100050;

int n, L[maxn], R[maxn], U[maxn], D[maxn];
set<int> r[maxn], l[maxn];

void gg(){pf("NE\n"); exit(0);}
int main()
{
	#ifdef MPS
		fp("1.in","r",stdin);
		fp("1.out","w",stdout);
	#endif
	sf("%d",&n);
	fo(i,1,n) {int x; sf("%d",&x); L[i] = x; if(x != -1) r[i].insert(x+1);}	
	fo(i,1,n) {int x; sf("%d",&x); R[i] = x; if(x != -1) r[i].insert(n-x);}
	fo(i,1,n) {int x; sf("%d",&x); U[i] = x; if(x != -1) l[i].insert(x+1);}
	fo(i,1,n) {int x; sf("%d",&x); D[i] = x; if(x != -1) l[i].insert(n-x);}
	fo(i,1,n) 
	{
		if(L[i] == -1 && SZ(r[i])) gg();
		if(L[i] != -1 && (!SZ(r[i]) || (*r[i].begin())-1 != L[i])) gg();
		if(R[i] == -1 && SZ(r[i])) gg();
		set<int>:: iterator it = r[i].end();
		if(R[i] != -1 && (!SZ(r[i]) || n-(*(--it)) != R[i])) gg();
		if(U[i] == -1 && SZ(l[i])) gg();
		if(U[i] != -1 && (!SZ(l[i]) || (*l[i].begin())-1 != U[i])) gg();
		if(D[i] == -1 && SZ(l[i])) gg(); 
		it = l[i].end();
		if(D[i] != -1 && (!SZ(l[i]) || n-(*(--it)) != D[i])) gg();
	}
	pf("DA\n");
	return 0;
}

Compilation message

kocka.cpp: In function 'int main()':
kocka.cpp:45:4: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  sf("%d",&n);
    ^
kocka.cpp:46:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fo(i,1,n) {int x; sf("%d",&x); L[i] = x; if(x != -1) r[i].insert(x+1);} 
                      ^
kocka.cpp:47:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fo(i,1,n) {int x; sf("%d",&x); R[i] = x; if(x != -1) r[i].insert(n-x);}
                      ^
kocka.cpp:48:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fo(i,1,n) {int x; sf("%d",&x); U[i] = x; if(x != -1) l[i].insert(x+1);}
                      ^
kocka.cpp:49:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fo(i,1,n) {int x; sf("%d",&x); D[i] = x; if(x != -1) l[i].insert(n-x);}
                      ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 9976 KB Output is correct
2 Correct 12 ms 9988 KB Output is correct
3 Correct 12 ms 10048 KB Output is correct
4 Correct 11 ms 10048 KB Output is correct
5 Correct 12 ms 10184 KB Output is correct
6 Correct 11 ms 10184 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 10284 KB Output is correct
2 Correct 11 ms 10300 KB Output is correct
3 Correct 12 ms 10460 KB Output is correct
4 Correct 12 ms 10460 KB Output is correct
5 Correct 12 ms 10588 KB Output is correct
6 Correct 11 ms 10588 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 21912 KB Output is correct
2 Correct 115 ms 34636 KB Output is correct
3 Correct 122 ms 37092 KB Output is correct
4 Correct 49 ms 37092 KB Output is correct
5 Correct 116 ms 40500 KB Output is correct
6 Correct 115 ms 42840 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 44852 KB Output is correct
2 Correct 50 ms 44852 KB Output is correct
3 Correct 114 ms 48500 KB Output is correct
4 Correct 99 ms 49732 KB Output is correct
5 Correct 116 ms 52124 KB Output is correct
6 Correct 106 ms 54044 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 54044 KB Output is correct
2 Correct 48 ms 54044 KB Output is correct
3 Correct 112 ms 59508 KB Output is correct
4 Correct 115 ms 61796 KB Output is correct
5 Correct 115 ms 64132 KB Output is correct
6 Correct 47 ms 64132 KB Output is correct