oj.uz

답안 #631721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
631721 2022-08-18T14:42:59 Z minhcool Monster Game (JOI21_monster) C++17
25 / 100
 236 ms 1200 KB 
#include "monster.h"
#include<bits/stdc++.h>
using namespace std;
 
//#define int long long
#define fi first
#define se second
#define pb push_back
//#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 1e5 + 5;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
int n, a[N], b[N];
 
int cnt = 0;
 
vector<int> er(vector<int> a, int x){
	vector<int> b;
	for(auto it : a) if(it != x) b.pb(it);
	return b;
}
 
/*
int Query(int x, int y){
	cnt++;
	if(b[x] < (b[y] - 1)) return 0;
	if(b[x] == (b[y] + 1)) return 0;
	return 1;
}*/
 
map<ii, bool> mp;
 
int Querry(int x, int y){
	if(mp.find({x, y}) != mp.end()) return mp[{x, y}];
    return mp[{x, y}] = Query(x, y);
}
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	temp = (temp + (r - l + 1)) % (r - l + 1);
	return temp + l;
}
 
int deg[N];
 
void solve_brute(vector<int> x, int l, int r){
	assert(x.size() == (r - l + 1));
	if(x.size() == 1){
		a[x[0]] = l;
		return;
	}
	assert(x.size() != 3);
	for(int i = 0; i < x.size(); i++) deg[x[i]] = 0;
	for(int i = 0; i < x.size(); i++){
		for(int j = i + 1; j < x.size(); j++){
			Querry(x[i], x[j]);
			if(mp[{x[i], x[j]}]) deg[x[i]]++;
			else deg[x[j]]++;
		}
	}
	if(x.size() == 2){
		if(!mp[{x[0], x[1]}]){
			a[x[0]] = r, a[x[1]] = l;
		}
		else{
			a[x[1]] = r, a[x[0]] = l;
		}
		return;
	}
	int mn0 = -1, mn1, mx0 = -1, mx1;
	//cout << x.size() << "\n";
	for(auto it : x){
		if(deg[it] >= 2 && deg[it] <= x.size() - 3){
			a[it] = l + deg[it];
		}
		if(deg[it] == 1){
			if(mn0 == -1) mn0 = it;
			else mn1 = it;
		}
		if(deg[it] == x.size() - 2){
			if(mx0 == -1) mx0 = it;
			else mx1 = it;
		}
		//cout << deg[it] << " ";
	}
	//cout << "\n";
	//for(auto it : x) cout << b[it] << " ";
	//cout << "\n";
	if(min({mn0, mn1, mx0, mx1}) < 0) exit(0);
	//cout << mn0 << " " << mn1 << "\n";
	if(mp[{mn0, mn1}]){
		a[mn0] = l; a[mn1] = l + 1;
	}
	else{
		a[mn0] = l + 1; a[mn1] = l;
	}
	if(mp[{mx0, mx1}]){
		a[mx0] = r - 1; a[mx1] = r;
	}
	else{
		a[mx0] = r; a[mx1] = r - 1;
	}
}
 
 
void solve(vector<int> x, int l, int r){
	//for(auto it : x) assert(b[it] >= l && b[it] <= r);
	shuffle(x.begin(), x.end(), default_random_engine(7405));
	if(x.size() <= 10){
		solve_brute(x, l, r);
		return;
	}
	int temp;
	vector<int> vc1, vc2;
	int iter = 0;
	while(1){
		iter++;
		temp = x[rnd(0, x.size() - 1)];
		int cnt1 = 0, cnt2 = 0;
		for(int i = 0; (cnt1 + cnt2) < 10; i++){
			if(temp == x[i]) continue;
			if(Querry(temp, x[i])) cnt1++;
			else cnt2++;
		}
		if(cnt1 < 2 || cnt2 < 2) continue;
		break;
	}
	//cout << temp << "\n";
	for(auto it : x){
		if(it == temp) continue;
		if(Query(temp, it)) vc1.pb(it);
		else vc2.pb(it);
	}
	//cout << vc1.size() << " " << vc2.size() << "\n";
	//cout << temp << " " << l + vc1.size() << "\n";
	a[temp] = l + vc1.size();
	int w1 = vc1[0], w2 = vc2[0];
	for(auto it : vc1){
		if(it == w1) continue;
		if(Querry(it, w1)) w1 = it;
	}
	for(auto it : vc2){
		if(it == w2) continue;
		if(Querry(w2, it)) w2 = it;
	}
	bool ck1 = 0, ck2 = 0;
	a[w1] = l + vc1.size() + 1;
	a[w2] = l + vc1.size() - 1;
	vc1 = er(vc1, w1);
	vc2 = er(vc2, w2);
	//vc1 = er(vc1, w1);
	//vc2 = er(vc2, w2);
	if(vc1.size() == 3) vc1.pb(w2);
	if(vc2.size() == 3) vc2.pb(w1);
	solve(vc1, l, l + vc1.size() - 1);
	solve(vc2, r - vc2.size() + 1, r);
}
 
/*
void solve(vector<int> x, int l, int r){
	if(x.size() <= 4){
		solve_brute(x, l, r);
		return;
	}
	int temp;
	vector<int> vc1, vc2;
	while(1){
		temp = x[rnd(0, x.size() - 1)];
		vc1.clear(), vc2.clear();
		for(auto it : x){
			if(it == temp) continue;
			if(!Query(it, temp)) vc1.pb(it);
			else vc2.pb(it);
		}
		assert(vc1.size() && vc2.size());
		if(vc1.size() == 1 || vc2.size() == 1) continue;
		if(vc1.size() == 4 || vc2.size() == 4) continue;
		break;
	}
	//cout << temp << " " << l + vc1.size() << "\n";
	a[temp] = l + vc1.size();
	int w1 = vc1[0], w2 = vc2[0];
	for(auto it : vc1){
		if(it == w1) continue;
		if(Query(it, w1)) w1 = it;
	}
	for(auto it : vc2){
		if(it == w2) continue;
		if(Query(w2, it)) w2 = it;
	}
	bool ck1 = 0, ck2 = 0;
	a[w1] = l + vc1.size() + 1;
	a[w2] = l + vc1.size() - 1;
	vc1 = er(vc1, w1);
	vc2 = er(vc2, w2);
	solve(vc1, l, l + vc1.size() - 1);
	solve(vc2, r - vc2.size() + 1, r);
}*/
 
vector<int> Solve(int _n){
	n = _n;
	vector<int> temp;
	for(int i = 0; i < n; i++) temp.pb(i);
	solve(temp, 0, n - 1);
	//solve_brute(temp, 0, n - 1);
	vector<int> temp2;
	for(int i = 0; i < n; i++) temp2.pb(a[i]);
	return temp2;
}
 
/*
void process(int t){
	int n = 1000;
	for(int i = 0; i < n; i++) b[i] = i;
	shuffle(b, b + n, default_random_engine(rnd(1, 10000)));
	Solve(n);
	cout << cnt << "\n";
	//for(int i = 0; i < n; i++) cout << a[i] << " " << b[i] << "\n";
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	int t;
	cin >> t;
	for(int i = 1; i <= t; i++) process(i);
	cout << fixed << setprecision(10) << (double)cnt / (double)t << "\n";
}
 
*/

Compilation message

monster.cpp:19:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from monster.cpp:2:
monster.cpp: In function 'void solve_brute(std::vector<int>, int, int)':
monster.cpp:57:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |  assert(x.size() == (r - l + 1));
      |         ~~~~~~~~~^~~~~~~~~~~~~~
monster.cpp:63:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |  for(int i = 0; i < x.size(); i++) deg[x[i]] = 0;
      |                 ~~^~~~~~~~~~
monster.cpp:64:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |  for(int i = 0; i < x.size(); i++){
      |                 ~~^~~~~~~~~~
monster.cpp:65:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   for(int j = i + 1; j < x.size(); j++){
      |                      ~~^~~~~~~~~~
monster.cpp:83:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |   if(deg[it] >= 2 && deg[it] <= x.size() - 3){
      |                      ~~~~~~~~^~~~~~~~~~~~~~~
monster.cpp:90:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |   if(deg[it] == x.size() - 2){
      |      ~~~~~~~~^~~~~~~~~~~~~~~
monster.cpp: In function 'void solve(std::vector<int>, int, int)':
monster.cpp:156:7: warning: unused variable 'ck1' [-Wunused-variable]
  156 |  bool ck1 = 0, ck2 = 0;
      |       ^~~
monster.cpp:156:16: warning: unused variable 'ck2' [-Wunused-variable]
  156 |  bool ck1 = 0, ck2 = 0;
      |                ^~~
monster.cpp: In function 'void solve_brute(std::vector<int>, int, int)':
monster.cpp:102:22: warning: 'mn1' may be used uninitialized in this function [-Wmaybe-uninitialized]
  102 |   a[mn0] = l; a[mn1] = l + 1;
      |               ~~~~~~~^~~~~~~
monster.cpp:80:31: warning: 'mx1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   80 |  int mn0 = -1, mn1, mx0 = -1, mx1;
      |                               ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 240 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 308 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 20 ms 384 KB Output is correct
17 Correct 20 ms 364 KB Output is correct
18 Correct 19 ms 376 KB Output is correct
19 Correct 20 ms 352 KB Output is correct
20 Correct 21 ms 376 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 0 ms 316 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 22 ms 348 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 0 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 28 ms 336 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 240 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 308 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 20 ms 384 KB Output is correct
17 Correct 20 ms 364 KB Output is correct
18 Correct 19 ms 376 KB Output is correct
19 Correct 20 ms 352 KB Output is correct
20 Correct 21 ms 376 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 0 ms 316 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 22 ms 348 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 0 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 28 ms 336 KB Output is correct
33 Correct 170 ms 896 KB Output is correct
34 Correct 107 ms 980 KB Output is correct
35 Correct 148 ms 868 KB Output is correct
36 Correct 162 ms 960 KB Output is correct
37 Correct 119 ms 968 KB Output is correct
38 Correct 128 ms 1084 KB Output is correct
39 Correct 124 ms 1020 KB Output is correct
40 Correct 176 ms 912 KB Output is correct
41 Correct 104 ms 932 KB Output is correct
42 Correct 138 ms 1096 KB Output is correct
43 Correct 144 ms 872 KB Output is correct
44 Correct 74 ms 896 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 154 ms 900 KB Partially correct
2 Partially correct 159 ms 1036 KB Partially correct
3 Partially correct 129 ms 916 KB Partially correct
4 Partially correct 131 ms 968 KB Partially correct
5 Partially correct 146 ms 960 KB Partially correct
6 Partially correct 121 ms 1008 KB Partially correct
7 Partially correct 179 ms 1048 KB Partially correct
8 Partially correct 185 ms 900 KB Partially correct
9 Partially correct 142 ms 996 KB Partially correct
10 Partially correct 117 ms 1044 KB Partially correct
11 Partially correct 173 ms 964 KB Partially correct
12 Partially correct 163 ms 936 KB Partially correct
13 Incorrect 236 ms 1200 KB Wrong Answer [6]
14 Halted 0 ms 0 KB -