oj.uz

Submission #286767

# Submission time Handle Problem Language Result Execution time Memory
286767 2020-08-30T21:25:42 Z CaroLinda Vision Program (IOI19_vision) C++14
12 / 100
 11 ms 1408 KB 
#include <bits/stdc++.h>
#include "vision.h"

#define lp(i,a,b) for(int i = a; i < b ; i++)
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mk make_pair
#define sz(x) (int)(x.size())
#define pii pair<int,int>
#define mkt make_tuple
#define debug printf

using namespace std ;

int N, M ;
vector<int> v1 , v2 , aux ;

int code(int i, int j) { return i * M + j ; }
bool valid(int x, int y) { return 0 <= min(x,y) && x < N && y < M ; }

int test(vector<int> &v , int K )
{

	vector<int> glob ;
	for(int i = 0 ; i + K < sz(v) ; i++ )
	{
		aux.clear() ;
		aux.pb( v[i+K] ) ;
		aux.pb( v[i] ) ;
		glob.pb( add_and(aux) ) ;
		//debug("fiz %d %d\n" , v[i],v[i+K]) ;
	}

	return add_or(glob) ;

}

void construct_network(int H, int W, int K) 
{
	N = H ;
	M = W ;

	for(int i = 0 ; i < H-1 ; i++ )
	{
		int x = i , y = 0 ;
		aux.clear() ;

		while( valid(x,y) )
		{
			aux.pb( code(x,y) ) ;
			x-- ;
			y++ ;
		}

		v1.pb( add_xor(aux) ) ;

		x = i , y = W-1 ;
		aux.clear() ;

		while( valid(x,y) )
		{
			aux.pb( code(x,y) ) ;
			x-- ;
			y-- ;
		}

		v2.pb(add_xor( aux ) ) ;

	}

	for(int j = 0 , jj = W-1 ; j < W ; j++, jj-- )
	{
		int x = H-1 , y = jj ;
		aux.clear() ;

		while(valid(x,y))
		{
			aux.pb( code(x,y) ) ;
			x-- ;
			y-- ;
		}


		v2.pb( add_xor(aux) ) ;

		aux.clear() ;
		x = H-1 , y = j ;

		while(valid(x,y))
		{
			aux.pb(code(x,y) ) ;
			x-- ;
			y++ ;
		}

		v1.pb( add_xor(aux) ) ;

	}

	vector<int> auxaux ;
	auxaux.pb( test(v1 , K ) ) ;
	auxaux.pb( test(v2, K ) ) ;

	int z1 = add_or(auxaux) ;

	if(K == H + W - 2) return ;

	auxaux.clear() ;
	auxaux.pb( test(v1, K+1 ) ) ;
	auxaux.pb( test(v2, K+1 ) ) ;

	int z2 = add_or( auxaux ) ;
	z2 = add_not(z2) ;

	aux.clear() ;
	aux.pb( z1 ) ;
	aux.pb(z2) ;

	add_and(aux) ;

}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Incorrect 6 ms 768 KB on inputs (0, 0), (199, 99), expected 0, but computed 1
22 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 1408 KB on inputs (126, 120), (176, 169), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -