oj.uz

답안 #1033476

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1033476 2024-07-24T22:03:13 Z ALeonidou Vision Program (IOI19_vision) C++17
0 / 100
 331 ms 1336 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;

	ll c = 0;
	for (ll x1 =0; x1<h; x1++){
		for (ll y1 =0; y1<w; y1++){
			for (ll x2 = x1+1; 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);
	}
	// printVct(v);

	add_or(v);
}

/*
2 3 3
0 1 0 2

2 3 3
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:44:10: warning: unused variable 'x' [-Wunused-variable]
   44 |       ll x = add_and({get_point(x1,y1), get_point(x2,y2)});
      |          ^

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 331 ms 1336 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -