oj.uz

Submission #97747

# Submission time Handle Problem Language Result Execution time Memory
97747 2019-02-18T03:06:38 Z jasony123123 Carnival (CEOI14_carnival) C++11
100 / 100
 10 ms 428 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <array>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define mp make_pair
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"

typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }

void io() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}

const ll INF = 1e14;
/***********************CEOI 2014 D1 Carnival*****************************************/
int n, ans[151];
v<v<int>> groups;

bool hasEdge(int lo, int hi, int x) {
	v<int> qlist = { x };
	FORE(i, lo, hi)
		qlist.push_back(groups[i][0]);
	cout << qlist.size();
	for (auto i : qlist)
		cout << " " << i;
	cout << endl;
	int dc; cin >> dc;
	return dc == qlist.size() - 1;
}

void ins(int x) {
	if (groups.empty() || !hasEdge(0, groups.size() - 1, x))
		groups.push_back({ x });
	else {
		int lo = 0, hi = groups.size() - 1;
		while (lo < hi) {
			int mid = (lo + hi) / 2;
			if (hasEdge(lo, mid, x))
				hi = mid;
			else
				lo = mid + 1;
		}
		groups[lo].push_back(x);
	}
}

int main() {
	io();
	cin >> n;
	FORE(i, 1, n) ins(i);
	
	FOR(g, 0, groups.size()) {
		for (auto x : groups[g])
			ans[x] = g + 1;
	}
	cout << "0";
	FORE(i, 1, n) cout << " " << ans[i];
	cout << endl;
	return 0;
}

Compilation message

carnival.cpp: In function 'bool hasEdge(int, int, int)':
carnival.cpp:48:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  return dc == qlist.size() - 1;
         ~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 384 KB Output is correct
2 Correct 6 ms 424 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 7 ms 256 KB Output is correct
3 Correct 5 ms 424 KB Output is correct
4 Correct 4 ms 424 KB Output is correct
5 Correct 8 ms 384 KB Output is correct
6 Correct 4 ms 424 KB Output is correct
7 Correct 5 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Correct 10 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 7 ms 256 KB Output is correct
6 Correct 9 ms 256 KB Output is correct
7 Correct 10 ms 256 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 256 KB Output is correct
2 Correct 6 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 5 ms 428 KB Output is correct
5 Correct 9 ms 384 KB Output is correct
6 Correct 7 ms 256 KB Output is correct
7 Correct 8 ms 256 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 7 ms 424 KB Output is correct
4 Correct 8 ms 256 KB Output is correct
5 Correct 8 ms 256 KB Output is correct
6 Correct 9 ms 256 KB Output is correct
7 Correct 6 ms 256 KB Output is correct