oj.uz

Submission #144812

# Submission time Handle Problem Language Result Execution time Memory
144812 2019-08-17T20:34:53 Z cfalas Vision Program (IOI19_vision) C++14
0 / 100
 20 ms 1816 KB 
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K) {
			std::vector<int> Ns;
	for(int x1=0;x1<W;x1++){
		for(int y1=0;y1<H;y1++){
			//cout<<endl<<x1+W*y1<<": \n";
			int origx=K+x1, origy=y1;
			vector<int> possiblexy;
			for(int i=0;i<K;i++){
				//cout<<origx+origy*W<<" ";
				if(origx<W && origx>=0 && origy<H && origy>=0){
					possiblexy.push_back(origx+origy*W);
				}
				origy++;
				origx--;
			}
			for(int i=0;i<K;i++){
				//cout<<origx+origy*W<<" ";
				if(origx<W && origx>=0 && origy<H && origy>=0){
					possiblexy.push_back(origx+origy*W);
				}
				origy--;
				origx--;
			}
			for(int i=0;i<K;i++){
				//cout<<origx+origy*W<<" ";
				if(origx<W && origx>=0 && origy<H && origy>=0){
					possiblexy.push_back(origx+origy*W);
				}
				origy--;
				origx++;
			}
			for(int i=0;i<K;i++){
				//cout<<origx+origy*W<<" ";
				if(origx<W && origx>=0 && origy<H && origy>=0){
					possiblexy.push_back(origx+origy*W);
				}
				origy++;
				origx++;
			}
			int a = add_or(possiblexy);
			vector<int> v;
			v.push_back(y1*W + x1);
			v.push_back(a);
			Ns.push_back(add_and(v));
		}
	}
	int a = add_or(Ns);
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:51:6: warning: unused variable 'a' [-Wunused-variable]
  int a = add_or(Ns);
      ^

Subtask #1
0 / 10.0

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

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 7 ms 884 KB Output is correct
4 Correct 20 ms 1816 KB Output is correct
5 Correct 14 ms 1392 KB Output is correct
6 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
7 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 1140 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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