제출 #643395

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
643395		ghostwriter	Vision Program (IOI19_vision)	C++14	0 / 100	2 ms	1104 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    VOI23 gold medal
*/
void construct_network(int H, int W, int K) {
	FOR(i, 0, H - 1)
	FOR(j, 0, W - 1) {
		int index = i * W + j;
		add_and({index});
	}
	vi ans;
	FOR(i, 0, H - 1)
	FOR(j, 0, W - 1)
	FOR(x, i, H - 1)
	FOR(y, (x == i? j : 0), W - 1) {
		if (x == i && y == j) continue;
		int index1 = H * W + i * W + j - 1, index2 = H * W + x * W + y - 1;
		ans.pb(add_and({index1, index2}));
	}
	add_or(ans);
}
/*
2 3 3
0 0 0 2
-1
*/
/*
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
*/

컴파일 시 표준 에러 (stderr) 메시지

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
vision.cpp:44:2: note: in expansion of macro 'FOR'
   44 |  FOR(i, 0, H - 1)
      |  ^~~
vision.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
vision.cpp:45:2: note: in expansion of macro 'FOR'
   45 |  FOR(j, 0, W - 1) {
      |  ^~~
vision.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
vision.cpp:50:2: note: in expansion of macro 'FOR'
   50 |  FOR(i, 0, H - 1)
      |  ^~~
vision.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
vision.cpp:51:2: note: in expansion of macro 'FOR'
   51 |  FOR(j, 0, W - 1)
      |  ^~~
vision.cpp:32:31: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
vision.cpp:52:2: note: in expansion of macro 'FOR'
   52 |  FOR(x, i, H - 1)
      |  ^~~
vision.cpp:32:31: warning: unnecessary parentheses in declaration of 'y' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
vision.cpp:53:2: note: in expansion of macro 'FOR'
   53 |  FOR(y, (x == i? j : 0), W - 1) {
      |  ^~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 0 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19