oj.uz

Submission #411350

# Submission time Handle Problem Language Result Execution time Memory
411350 2021-05-25T06:28:40 Z ismoilov Vision Program (IOI19_vision) C++14
0 / 100
 2 ms 1096 KB 
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
//#define int ll
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fv(a, c) for(int (a) = (1); (a) <= (c); (a)++)
#define fz(a, c) for(int (a) = (0); (a) < (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
#define pb push_back
#define in insert
#define ss second
#define ff first
#define vi vector <int>
#define fa(a, v) for(auto (a) : (v))
#define mnel(a) *min_element(all(a))
#define mxel(a) *max_element(all(a))
#define si set<int>
#define sov(a) sort(all((a)))
void construct_network(int h, int w, int k) {
	vector<int> ss;
	//set<pair<int, int>> s;
	fpp(i,1,h){
		fpp(j,1,w){
			int a = 0, b = k, x = i*w + j;
			while(b >= 0){
				int y = (a+i)*w + (b+j);
				if(a + i <= h && b + j <= w){
					ss.pb(add_and({x, (a+i)*w + (b+j)}));
				}
				if(a + i <= h && b - j > 0){
					ss.pb(add_and({x, (a+i)*w + (b-j)}));
				}
				if(a - i > 0 && b + j <= w){
					ss.pb(add_and({x, (a-i)*w + (b+j)}));
				}
				if(a - i > 0 && b - j > 0){
					ss.pb(add_and({x, (a-i)*w + (b-j)}));
				}
			}
		}
	}
	add_or(ss);
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:15:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
      |                            ^
vision.cpp:33:2: note: in expansion of macro 'fpp'
   33 |  fpp(i,1,h){
      |  ^~~
vision.cpp:15:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   15 | #define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
      |                            ^
vision.cpp:34:3: note: in expansion of macro 'fpp'
   34 |   fpp(j,1,w){
      |   ^~~
vision.cpp:37:9: warning: unused variable 'y' [-Wunused-variable]
   37 |     int y = (a+i)*w + (b+j);
      |         ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB WA in grader: Invalid index
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB WA in grader: Invalid index
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB WA in grader: Invalid index
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB WA in grader: Invalid index
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB WA in grader: Invalid index
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB WA in grader: Invalid index
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1096 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 Incorrect 1 ms 204 KB WA in grader: Invalid index
2 Halted 0 ms 0 KB -