Submission #232958

#	Time	Username	Problem	Language	Result	Execution time	Memory
232958		cfalas	ICC (CEOI16_icc)	C++14	0 / 100	33 ms	664 KiB

icc

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID (l+r)/2
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6

#define T double
typedef complex<T> pt;
#define x real()
#define y imag()
T dot(pt v, pt w) {return (conj(v)*w).x;}
T cross(pt v, pt w) {return (conj(v)*w).y;}
T orient(pt a, pt b, pt c) {return cross(b-a,c-a);}
T dist(pt a, pt b) {return abs(a-b);}

#include "icc.h"

void run(int n){
	for(int i=0;i<n;i++){
		vi t;
		for(int j=0;j<n;j++){
			int a[1] = {j+1};
			int b[n-1];
			int cnt=0;
			for(int k=0;k<n;k++) if(k!=j) b[cnt++]=k+1;
			if(query(1, n-1, a, b)){
				t.push_back(j+1);
			}
		}
		setRoad(t[0], t[1]);
	}
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 21
• Subtask 5: 0 / 29
• Subtask 6: 0 / 10