oj.uz

Submission #882329

# Submission time Handle Problem Language Result Execution time Memory
882329 2023-12-03T04:35:42 Z ono_de206 ICC (CEOI16_icc) C++14
0 / 100
 15 ms 856 KB 
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;

#include<bits/stdc++.h>
using namespace std;

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

//#define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

const int mxn = 110;
int A[mxn], B[mxn];
vector<int> g[mxn];

int ask(vector<int> a, vector<int> b) {
	int sza = 0, szb = 0;
	for(int x : a) {
		for(int y : g[x]) {
			A[sza++] = y;
		}
	}
	for(int x : b) {
		for(int y : g[x]) {
			B[szb++] = y;
		}
	}
	return query(sza, szb, A, B);
}

void run(int n) {
	vector<int> all;
	for(int i = 1; i <= n; i++) {
		g[i].pb(i);
		all.pb(i);
	}
	for(int t = 1; t < n; t++) {
		vector<int> a, b;
		for(int i = n; i >= 1; i--) {
			b.pb(i);
		}
		int x = -1, y = -1;
		for(int i = 1; i <= n; i++) {
			a.pb(i);
			b.pop_back();
			int tmp = ask(a, b);
			if(tmp == 0 && y == -1 && x != -1) y = i;
			if(tmp == 1 && x == -1) x = i;
		}
		setRoad(x, y);
	}
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 604 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 604 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 600 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 856 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 604 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 600 KB Wrong road!
2 Halted 0 ms 0 KB -