제출 #502510

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
502510		PoPularPlusPlus	Vision Program (IOI19_vision)	C++17	0 / 100	1 ms	1224 KiB

vision

#include <bits/stdc++.h>
#include "vision.h"
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void construct_network(int n , int m , int k){
	int arr[n][m];
	vector<int> v;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			if(j == m -1 && i == n - 1)continue;
			arr[i][j] = (1 + add_not(i * m + j)) % 2;
			if(arr[i][j] == 1)v.pb(i * m + j);
		}
	}
	if(v.size() == 1)v.pb(n * m - 1);
	int x = v[0]/m , y = v[0] % m , x1 = v[1] / m , y1 = v[1] % m;
	if(abs(x - x1) + abs(y - y1) == k){
		add_and({v[0]});
	}
	else {
		add_not(v[0]);
	}	
}

/*

void solve(){
	
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//freopen("dec.in", "r", stdin);
//freopen("dec.out", "w", stdout);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}
*/

• 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