Submission #825739

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
825739	2023-08-15T07:33:37 Z	tolbi	Vision Program (IOI19_vision)	C++17	0 / 100	2 ms	976 KB

vision

#pragma optimize("Bismilahirrahmanirrahim")
//█▀█─█──█──█▀█─█▀█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define vint(x) vector<int> x
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define tol(bi) (1LL<<((int)(bi)))
typedef long long ll;
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());

#include "vision.h"

void construct_network(int H, int W, int K) {
	vector<int> final;
	if (H*W==2){
		assert(false);
		if (K==1){
			add_or({0,1});
		}
		else {
			add_not(0);
		}
		return;
	}
	for (int i = 0; i < H; i++){
		for (int j = 0; j < W; j++){
			vector<int> arr;
			for (int uza = -K; uza <= K; uza++){
				int x = i+uza;
				int y1 = i+(K-abs(uza));
				int y2 = i-(K-abs(uza));
				if (x<0 || x>=H) continue;
				if (y1>=0 && y1<W){
					arr.push_back(x*W+y1);
				}
				if (y2>=0 && y2<W){
					arr.push_back(x*W+y2);
				}
			}
			if (arr.size()==0) continue;
			int pos = add_or(arr);
			final.push_back(add_and({i*W+j,pos}));
		}
	}
	if (final.size()==0){
		add_and({0,1,2});
	}
	else add_or(final);
}

Compilation message

vision.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismilahirrahmanirrahim")
      |

Subtask #1
0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Incorrect	212 KB	on inputs (0, 1), (0, 2), expected 0, but computed 1
3	Halted	0 KB	-

Subtask #2
0 / 11.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Incorrect	212 KB	on inputs (0, 1), (0, 2), expected 0, but computed 1
3	Halted	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Incorrect	212 KB	on inputs (0, 1), (0, 2), expected 0, but computed 1
3	Halted	0 KB	-

Subtask #4
0 / 15.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Incorrect	212 KB	on inputs (0, 1), (0, 2), expected 0, but computed 1
3	Halted	0 KB	-

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Incorrect	212 KB	on inputs (0, 0), (1, 0), expected 0, but computed 1
3	Halted	0 KB	-

Subtask #7
0 / 14.0

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

Subtask #8
0 / 19.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Incorrect	212 KB	on inputs (0, 1), (0, 2), expected 0, but computed 1
3	Halted	0 KB	-