Submission #837229

#TimeUsernameProblemLanguageResultExecution timeMemory
837229TrumlingVision Program (IOI19_vision)C++14
0 / 100
1 ms976 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()

void construct_network(int H, int W, int K) 
{
	int curr=K;
	ll idx=0;
				while(curr>=0)
				{
					if(curr>=W || (K-curr)>=H)
					{
						curr--;
						continue;
					}
	
					add_and({0,H*(K-curr)+curr});
					idx++;
				}

	vector<int>ans;
	for(int i=W*H;i<W*H+idx;i++)
	ans.pb(i);

	add_or(ans);
		
		
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...