Submission #594703

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
594703	2022-07-12T20:31:25 Z	Deepesson	Vision Program (IOI19_vision)	C++17	0 / 100	1 ms	1236 KB

vision

#include <bits/stdc++.h>

void construct_network(int H, int W, int K);

int add_and(std::vector<int> Ns);

int add_or(std::vector<int> Ns);

int add_xor(std::vector<int> Ns);

int add_not(int N);

int tiles[505][505];

void plotar_tiles(int H,int W){
    for(int i=0;i!=H;++i){
        for(int j=0;j!=W;++j){
            tiles[i][j]=(i*W)+j;
        }
    }
}
void construct_network(int H, int W, int K) {
    plotar_tiles(H,W);
	///Min(H,W) == 1
	if(std::min(H,W)==1){
        if(H==1){
            int count=0;
            for(int i=0;i!=W;++i){
                int esperado = i+K;
                if(esperado>=W)break;
                std::vector<int> v;
                v.push_back(tiles[0][i]);
                v.push_back(tiles[0][esperado]);
                add_and(v);
                ++count;
            }
            std::vector<int> orzao;
            for(int i=0;i!=count;++i)orzao.push_back(H*W+i);
            add_or(orzao);
        }else {
            int count=0;
            for(int i=0;i!=H;++i){
                int esperado = i+K;
                if(esperado>=H)break;
                std::vector<int> v;
                v.push_back(tiles[i][0]);
                v.push_back(tiles[esperado][0]);
                add_and(v);
                +
                +count;
            }
            std::vector<int> orzao;
            for(int i=0;i!=count;++i)orzao.push_back(H*W+i);
            add_or(orzao);
        }
	}else assert(0);
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:49:17: warning: statement has no effect [-Wunused-value]
   49 |                 +
      |                 ^
   50 |                 +count;
      |                 ~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	468 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	1236 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 19.0

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