oj.uz

Submission #146991

# Submission time Handle Problem Language Result Execution time Memory
146991 2019-08-27T02:36:58 Z gs18115 Vision Program (IOI19_vision) C++14
20 / 100
 14 ms 1528 KB 
#include"vision.h"
#include<algorithm>
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const ll inf=1e18;
void construct_network(int H,int W,int K)
{
	vector<int>r,c;
	vector<int>q,q1,q2;
	int zero;
	zero=add_xor(vector<int>(2,0));
	int fs;
	int i,j;
	int n=H+W-1;
	for(i=0;i<n;i++)
	{
		for(j=0;j<H;j++)
		{
			if(i-j>=W&&j<=i)
				continue;
			q.eb(j*W+i-j);
		}
		r.eb(add_or(q));
		q.clear();
	}
	for(i=0;i<n;i++)
	{
		for(j=0;j<H&&j<=i;j++)
		{
			if(i-j>=W)
				continue;
			q.eb(j*W+W-i+j-1);
		}
		c.eb(add_or(q));
		q.clear();
	}
	for(i=0;i+K<n;i++)
	{
		q.eb(r[i]);
		q.eb(r[i+K]);
		q1.eb(add_and(q));
		q.clear();
		q.eb(c[i]);
		q.eb(c[i+K]);
		q1.eb(add_and(q));
		q.clear();
	}
	fs=zero;
	for(i=K;++i<n;)
	{
		q.eb(fs);
		q.eb(r[i-K-1]);
		fs=add_or(q);
		q.clear();
		q.eb(fs);
		q.eb(r[i]);
		q2.eb(add_and(q));
		q.clear();
	}
	fs=zero;
	for(i=K;++i<n;)
	{
		q.eb(fs);
		q.eb(c[i-K-1]);
		fs=add_or(q);
		q.clear();
		q.eb(fs);
		q.eb(c[i]);
		q2.eb(add_and(q));
		q.clear();
	}
	q.eb(add_or(q1));
	if(!q2.empty())
		q.eb(add_not(add_or(q2)));
	add_and(q);
	q.clear();
	return;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 4 ms 504 KB Output is correct
11 Correct 4 ms 504 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 4 ms 504 KB Output is correct
19 Correct 4 ms 504 KB Output is correct
20 Correct 9 ms 1144 KB Output is correct
21 Correct 9 ms 1144 KB Output is correct
22 Correct 9 ms 1016 KB Output is correct
23 Correct 8 ms 888 KB Output is correct
24 Correct 8 ms 1016 KB Output is correct
25 Correct 8 ms 888 KB Output is correct
26 Correct 7 ms 760 KB Output is correct
27 Correct 14 ms 1528 KB Output is correct
28 Correct 13 ms 1528 KB Output is correct
29 Correct 13 ms 1528 KB Output is correct
30 Correct 14 ms 1400 KB Output is correct
31 Correct 12 ms 1244 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 1528 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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