제출 #307758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
307758		AKaan37	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	272 ms	22136 KiB

supertrees

#include "supertrees.h"
//Bismillahirrahmanirrahim

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int m,a[li],k,flag,t;
int cev;
string s;
vector<int> v;

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> a;
	for (int i = 0; i < n; i++) {
		vector<int> vv;
		for(int j=0;j<n;j++){
			if(i==j){vv.pb(0);continue;}
			if(j==i+1 || j==i-1){vv.pb(1);continue;}
			else {vv.pb(0);continue;}
		}
		a.pb(vv);
	}
	build(a);
	return 1;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4