oj.uz

Submission #439510

# Submission time Handle Problem Language Result Execution time Memory
439510 2021-06-30T07:00:47 Z 8e7 Monster Game (JOI21_monster) C++17
88 / 100
 174 ms 2464 KB 
#include "monster.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <time.h>
#include <random>

#define maxn 1005
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ";debug(b ...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
namespace {
	int cnt[maxn];
	bool res[maxn][maxn];
	bool found[maxn][maxn];
}  // namespace
bool que(int a, int b) {
	if (found[a][b]) return res[a][b];
	bool ret = Query(a, b);
	found[a][b] = found[b][a] = 1;
	res[a][b] = ret, res[b][a] = ret ^ 1;
	return ret;
}
void mergesort(vector<int> &v) {
	if (v.size() <= 1) {
		return;
	}
	vector<int> lef, rig;
	for (int i = 0;i < v.size();i++) {
		if (i < (v.size() / 2)) lef.push_back(v[i]);
		else rig.push_back(v[i]);
	}
	mergesort(lef), mergesort(rig);	
	vector<int> ret;
	int ind = 0;
	for (int i = 0;i < lef.size();i++) {
		while (ind < rig.size() && que(lef[i], rig[ind])) {
			ret.push_back(rig[ind]);
			ind++;
		}
		ret.push_back(lef[i]);
	}
	while (ind < rig.size()) ret.push_back(rig[ind++]);
	v = ret;
}

vector<int> Solve(int N) {
	vector<int> ret;
	vector<int> cand;
	for (int i = 0;i < N;i++) cand.push_back(i);
	mergesort(cand);
	//pary(cand.begin(), cand.end());
	vector<pii> cur;
	for (int i = N - 1;i >= 0;i--) {
		int loss = 0;	
		for (auto &j:cur) {
			if (que(cand[i], cand[j.ff])) j.ss++;
			else loss++;	
		}
		for (int j = cur.size() - 1;j >= 0;j--) {
			if (cur[j].ss > 1) {
				cur.erase(cur.begin() + j);		
			}
		}
		if (loss < 2) {
			cur.push_back({i, loss});
		}
	}	
	//cout << 7122 << endl;
	//for (auto i:cur) cout << i.ff << " ";
	//cout << endl;
	int big;
	if (cur.size() == 2) {
		if (que(cand[cur[0].ff], cand[cur[1].ff])) big = cur[1].ff;
		else big = cur[0].ff;
	} else {
		big = cur[0].ff;
		for (int i = 0;i < 2;i++) {
			if (cur[i + 1].ff == cur[i].ff - 1) big = cur[i + 1].ff;
			else {
				break;
			}
		}
	}
	//debug(big);
	for (int i = big;i < N;i++) ret.push_back(cand[i]);
	int comp = N - 1;
	for (int i = big - 1;i >= 0;i--) {
		if (que(cand[i], cand[comp])) {
			for (int j = i;j < big;j++) ret.push_back(cand[j]);
			comp = big - 1, big = i;
		}
	}
	reverse(ret.begin(), ret.end());
	vector<int> a (N, 0);
	for (int i = 0;i < N;i++) a[ret[i]] = i;
	return a;
}
/*
5
3 1 4 2 0

8
7 3 4 2 1 5 6 0

10
0 2 8 3 9 4 6 7 5 1
*/

Compilation message

monster.cpp: In function 'void mergesort(std::vector<int>&)':
monster.cpp:37:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for (int i = 0;i < v.size();i++) {
      |                 ~~^~~~~~~~~~
monster.cpp:38:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |   if (i < (v.size() / 2)) lef.push_back(v[i]);
      |       ~~^~~~~~~~~~~~~~~~
monster.cpp:44:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |  for (int i = 0;i < lef.size();i++) {
      |                 ~~^~~~~~~~~~~~
monster.cpp:45:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |   while (ind < rig.size() && que(lef[i], rig[ind])) {
      |          ~~~~^~~~~~~~~~~~
monster.cpp:51:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |  while (ind < rig.size()) ret.push_back(rig[ind++]);
      |         ~~~~^~~~~~~~~~~~
monster.cpp: At global scope:
monster.cpp:21:6: warning: '{anonymous}::cnt' defined but not used [-Wunused-variable]
   21 |  int cnt[maxn];
      |      ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 19 ms 656 KB Output is correct
17 Correct 22 ms 788 KB Output is correct
18 Correct 20 ms 644 KB Output is correct
19 Correct 16 ms 600 KB Output is correct
20 Correct 17 ms 584 KB Output is correct
21 Correct 1 ms 200 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 15 ms 584 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 1 ms 200 KB Output is correct
29 Correct 1 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 11 ms 664 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 19 ms 656 KB Output is correct
17 Correct 22 ms 788 KB Output is correct
18 Correct 20 ms 644 KB Output is correct
19 Correct 16 ms 600 KB Output is correct
20 Correct 17 ms 584 KB Output is correct
21 Correct 1 ms 200 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 15 ms 584 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 1 ms 200 KB Output is correct
29 Correct 1 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 11 ms 664 KB Output is correct
33 Correct 93 ms 2256 KB Output is correct
34 Correct 103 ms 2368 KB Output is correct
35 Correct 167 ms 2172 KB Output is correct
36 Correct 127 ms 2264 KB Output is correct
37 Correct 114 ms 2216 KB Output is correct
38 Correct 114 ms 2212 KB Output is correct
39 Correct 118 ms 2272 KB Output is correct
40 Correct 98 ms 2200 KB Output is correct
41 Correct 107 ms 2264 KB Output is correct
42 Correct 105 ms 2336 KB Output is correct
43 Correct 88 ms 2208 KB Output is correct
44 Correct 70 ms 2272 KB Output is correct

Subtask #3
63.0 / 75.0

# Verdict Execution time Memory Grader output
1 Partially correct 110 ms 2336 KB Partially correct
2 Partially correct 90 ms 2156 KB Partially correct
3 Partially correct 103 ms 2236 KB Partially correct
4 Partially correct 76 ms 2328 KB Partially correct
5 Partially correct 119 ms 2304 KB Partially correct
6 Partially correct 96 ms 2264 KB Partially correct
7 Partially correct 142 ms 2464 KB Partially correct
8 Partially correct 173 ms 2264 KB Partially correct
9 Partially correct 146 ms 2184 KB Partially correct
10 Partially correct 67 ms 2200 KB Partially correct
11 Partially correct 141 ms 2244 KB Partially correct
12 Partially correct 174 ms 2164 KB Partially correct
13 Partially correct 54 ms 2244 KB Partially correct
14 Partially correct 99 ms 2260 KB Partially correct
15 Correct 106 ms 2392 KB Output is correct
16 Correct 120 ms 2240 KB Output is correct
17 Partially correct 146 ms 2264 KB Partially correct
18 Correct 122 ms 2240 KB Output is correct