제출 #448667

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
448667		PedroBigMan	Vision Program (IOI19_vision)	C++14	44 / 100	11 ms	2884 KiB

vision

#include "vision.h"
/*
Author of all code: Pedro BIGMAN Dias
Last edit: 15/02/2021
*/
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 500000000LL
#define EPS 0.00000001
#define pi 3.14159
ll mod=1000000007LL;

template<class A=ll> 
void Out(vector<A> a) {REP(i,0,a.size()) {cout<<a[i]<<" ";} cout<<endl;}

template<class A=ll>
void In(vector<A> &a, ll N) {A cur; REP(i,0,N) {cin>>cur; a.pb(cur);}} 

void construct_network(int H, int W, int K) 
{
	vector<ll> cell;
	REP(i,0,H*W) {cell.pb(i);}
	add_or(cell);
	REP(i,0,H)
	{
		REP(j,0,W)
		{
			cell.clear();
			REP(r,i-K+1,i+K+1)
			{
				ll c = j+K-abs(r-i);
				if(r<0 || r>=H || c<0 || c>=W) {continue;}
				cell.pb(r*W+c);
			}
			if(cell.size()>0) {add_or(cell);} else {add_not(H*W);}
		}
	}
	cell.clear();
	REP(i,0,H*W)
	{
		cell.pb(add_and({i,H*W+1+i}));
	}
	add_or(cell);
}

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

vision.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("O3")
      | 
vision.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization ("unroll-loops")
      |

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