oj.uz

Submission #1033484

# Submission time Handle Problem Language Result Execution time Memory
1033484 2024-07-24T22:16:17 Z ALeonidou Vision Program (IOI19_vision) C++17
8 / 100
 1 ms 436 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

#define ll int
#define pb push_back
#define sz(x) (ll)x.size()
#define F first 
#define S second 
#define endl "\n"

typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;

#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;

void printVct(vi &v){
    for (ll i =0; i<sz(v); i++){
        cout<<v[i]<<" ";
    }
    cout<<endl;
}

ll h, w, k;

ll get_point(ll x, ll y){
	return (x * w) + y;
}

void construct_network(int H, int W, int K) {
	h = H, w = W, k = K;

	// if (h * w == 2) return;

	// ll c = 0;
	// for (ll x1 =0; x1<h; x1++){
	// 	for (ll y1 =0; y1<w; y1++){
	// 		for (ll x2 = 0; x2<h; x2++){
	// 			for (ll y2 = 0; y2 < w; y2++){
	// 				if (x1 == x2 && y1 == y2) continue;
	// 				ll d = abs(x1-x2) + abs(y1-y2);
	// 				if (d == k){
	// 					ll x = add_and({get_point(x1,y1), get_point(x2,y2)});
	// 					c++;
	// 					// dbg(c);
	// 					// dbg3(x1,y1,get_point(x1,y1));
	// 					// dbg3(x2,y2,get_point(x2,y2));
	// 				}
	// 			}
	// 		}
	// 	}
	// }

	//subtask 6:
	ll x1 = 0, y1 = 0, c = 0;
	for (ll x2 = 0; x2<h; x2++){
		for (ll y2 = 0; y2 < w; y2++){
			if (x1 == x2 && y1 == y2) continue;
			ll d = abs(x1-x2) + abs(y1-y2);
			if (d == k){
				ll x = add_and({get_point(x1,y1), get_point(x2,y2)});
				c++;
				// dbg(c);
				// dbg3(x1,y1,get_point(x1,y1));
				// dbg3(x2,y2,get_point(x2,y2));
			}
		}
	}
	
	vi v;
	for (ll i =h*w; i<h*w+c; i++){
		v.pb(i);
	}

	add_or(v);
}

/*

1 2 1
0 0 0 1
-1

2 3 3
0 1 0 2

2 3 4
0 2 1 0
-1


2 3 3
0 0 0 1
0 0 0 2
0 0 1 0
0 0 1 1
0 0 1 2
0 1 0 2
0 1 1 0
0 1 1 1
0 1 1 2
0 2 1 0
0 2 1 1
0 2 1 2
1 0 1 1
1 0 1 2
1 1 1 2
-1

*/

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:64:8: warning: unused variable 'x' [-Wunused-variable]
   64 |     ll x = add_and({get_point(x1,y1), get_point(x2,y2)});
      |        ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 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 1 ms 344 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 1 ms 344 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 1 ms 344 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 1 ms 344 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 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 356 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 388 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 436 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct

Subtask #7
0 / 14.0

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