oj.uz

Submission #419018

# Submission time Handle Problem Language Result Execution time Memory
419018 2021-06-06T10:41:10 Z mosiashvililuka Vision Program (IOI19_vision) C++14
8 / 100
 1 ms 268 KB 
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,k,p[1000009],pi;
vector <int> vv;
int F(int q, int w){
	return q*b+w;
}
void construct_network(int H, int W, int K) {
	a=H;b=W;k=K;
	if(a<=30&&b<=30){
		for(i=0; i<a; i++){
			for(j=0; j<b; j++){
				vv.clear();
				for(ii=0; ii<a; ii++){
					for(jj=0; jj<b; jj++){
						if(abs(i-ii)+abs(j-jj)!=k) continue;
						vv.push_back(F(ii,jj));
					}
				}
				c=add_or(vv);
				pi++;
				vv.clear();vv.push_back(c);vv.push_back(F(i,j));
				p[pi]=add_and(vv);
			}
		}
		vv.clear();
		for(i=1; i<=pi; i++){
			vv.push_back(p[i]);
		}
		add_or(vv);
		return;
	}
	vv.clear();pi=0;
	for(i=0; i<a; i++){
		for(j=0; j<b; j++){
			if(i+j==k){
				vv.push_back(F(i,j));
			}
		}
	}
	pi++;
	p[pi]=add_or(vv);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB on inputs (0, 1), (0, 3), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 268 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 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -