oj.uz

Submission #622629

# Submission time Handle Problem Language Result Execution time Memory
622629 2022-08-04T12:46:53 Z Dremix10 Vision Program (IOI19_vision) C++17
8 / 100
 1 ms 340 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define F first
#define S second
#define all(x) (x).begin(),(x).end()
#ifdef dremix
    #define p(x) cerr<<#x<<" = "<<x<<endl;
    #define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
    #define pp(x) cerr<<#x<<" = "<<x.F<<"-"<<x.S<<endl;
    #define pv(x) cerr<<#x<<" = {";for(auto v : x)cerr<<v<<", ";cerr<<"}"<<endl;
    #define ppv(x) cerr<<#x<<" = {";for(auto v : x)cerr<<v.F<<"-"<<v.S<<", ";cerr<<"}"<<endl;
#else
    #define p(x) {}
    #define p2(x,y) {}
	#define pp(x) {}
    #define pv(x) {}
    #define ppv(x) {}
#endif
//const int N = 3e5+5;
const int MOD = 1e9+7;
const ll INF = 1e18+5;



int N,M;

int foo(pi x){
	return x.F*M+x.S;
}
pi oof(int x){
	return {x/M,x%M};
}

int di[] = {1,0,-1,0};
int dj[] = {0,1,0,-1};

void print(queue<pi> q){
	#ifdef dremix
		while(!q.empty()){
			pp(oof(q.front().F))
			q.pop();
		}
	#endif
}

void construct_network(int n, int m, int K) {
	int i,j,k;
	N = n;
	M = m;
	vector<int> chk;

	for(i=0;i<1;i++)for(j=0;j<1;j++){
		queue<pi> q;
		q.push({foo({i,j}),0});
		bool v[n][m] = {};
		v[i][j] = true;
		
		while(!q.empty()){
			if(q.front().S == K)break;
			pi temp = q.front();
			q.pop();
			
			pi x = oof(temp.F);
			pp(x)
			p(temp.S)
			for(k=0;k<4;k++){
				int ni = x.F + di[k];
				int nj = x.S + dj[k];
				if(ni < 0 || ni >= n || nj < 0 || nj >= m)continue;
				if(v[ni][nj])continue;
				q.push({foo({ni,nj}),temp.S+1});
				v[ni][nj] = true;
			}

		}

		pp(make_pair(i,j))
		print(q);

		while(!q.empty()){
			chk.push_back(add_and({q.front().F,foo({i,j})}));
			assert(q.front().S == K);
			q.pop();
		}
		
	}
	pv(chk)
	int idx = add_or(chk);
	return;

}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:92:6: warning: unused variable 'idx' [-Wunused-variable]
   92 |  int idx = add_or(chk);
      |      ^~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 300 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 296 KB Output is correct
33 Correct 1 ms 252 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 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 Incorrect 0 ms 212 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -