oj.uz

Submission #820076

# Submission time Handle Problem Language Result Execution time Memory
820076 2023-08-10T18:51:01 Z MohamedAhmed04 The Collection Game (BOI21_swaps) C++14
5 / 100
 10 ms 352 KB 
#include <bits/stdc++.h>
#include "swaps.h"

using namespace std ;

int n ;

mt19937 rng(2004) ;

vector<int>solve()
{
	vector< vector<int> >v ;
	for(int i = 1 ; i <= n ; ++i)
		v.push_back({i}) ;
	while(v.size() > 1)
	{
		shuffle(v.begin() , v.end() , rng) ;
		vector< vector<int> >v2 ;
		int sz = v.size() ;
		vector< array<int , 4> >state ;
		for(int i = 0 ; i < sz-1 ; i += 2)
		{
			state.push_back({i , i+1 , 0 , 0}) ;
			v2.push_back({}) ;
		}
		if((sz & 1))
			v2.push_back(v[sz-1]) ;
		bool ok = false ;
		while(!ok)
		{
			int cnt = 0 ;
			for(auto &a : state)
			{
				if(a[2] < v[a[0]].size() && a[3] < v[a[1]].size())
					cnt++ , schedule(v[a[0]][a[2]] , v[a[1]][a[3]]) ;
				else if(a[2] < v[a[0]].size() && a[3] == v[a[1]].size())
				{
					while(a[2] < v[a[0]].size())
						v2[a[0]/2].push_back(v[a[0]][a[2]]) , a[2]++ ;
					//schedule(v[a[0]][a[2]] , v[a[0]][a[2]+1]) ;
				}
				else if(a[2] == v[a[0]].size() && a[3] < v[a[1]].size())
				{
					while(a[3] < v[a[1]].size())
						v2[a[0]/2].push_back(v[a[1]][a[3]]) , a[3]++ ;
					//schedule(v[a[1]][a[3]] , v[a[1]][a[3]+1]) ;
				}
			}
			vector<int>cur ;
			if(cnt)
				cur = visit() ;
			int idx = 0 ;
			for(auto &a : state)
			{
				int idx2 = a[0] / 2 ;
				if(a[2] < v[a[0]].size() && a[3] < v[a[1]].size())
				{
					if(cur[idx])
						v2[idx2].push_back(v[a[0]][a[2]]) , a[2]++ ;
					else
						v2[idx2].push_back(v[a[1]][a[3]]) , a[3]++ ;
					if(a[2] == v[a[0]].size() && a[3] == (int)(v[a[1]].size()) - 1)
						v2[idx2].push_back(v[a[1]][a[3]]) , a[3]++ ;
					else if(a[3] == v[a[1]].size() && a[2] == (int)(v[a[0]].size()) - 1)
						v2[idx2].push_back(v[a[0]][a[2]]) , a[2]++ ;
					++idx ;
				}
				// else if(a[2] < v[a[0]].size() && a[3] == v[a[1]].size())
				// {
				// 	if(!cur[idx])
				// 		swap(v[a[0]][a[2]] , v[a[0]][a[2]+1]) ;
				// 	v2[idx2].push_back(v[a[0]][a[2]]) ;
				// 	a[2]++ ;
				// 	if(a[2] == (int)(v[a[0]].size()) - 1)
				// 		v2[idx2].push_back(v[a[0]][a[2]]) , a[2]++ ;
				// 	++idx ;
				// }
				// else if(a[2] == v[a[0]].size() && a[3] < v[a[1]].size())
				// {
				// 	if(!cur[idx])
				// 		swap(v[a[1]][a[3]] , v[a[1]][a[3]+1]) ;
				// 	v2[idx2].push_back(v[a[1]][a[3]]) ;
				// 	a[3]++ ;
				// 	if(a[3] == (int)(v[a[1]].size()) - 1)
				// 		v2[idx2].push_back(v[a[1]][a[3]]) , a[3]++ ;
				// 	++idx ;	
				// }
			}
			ok = true ;
			for(auto &a : state)
				ok &= (a[2] == v[a[0]].size() && a[3] == v[a[1]].size()) ;
		}
		v = v2 ;
		// for(int i = 0 ; i < v.size() ; ++i)
		// {
		// 	for(auto &x : v[i])
		// 		cout<<x<<" " ;
		// 	cout<<"\n" ;
		// }
	}
	return v[0] ;
}

void solve(int N, int V) 
{
	n = N ;
	answer(solve()) ;
	return ;
}

Compilation message

swaps.cpp: In function 'std::vector<int> solve()':
swaps.cpp:34:13: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     if(a[2] < v[a[0]].size() && a[3] < v[a[1]].size())
swaps.cpp:34:38: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     if(a[2] < v[a[0]].size() && a[3] < v[a[1]].size())
swaps.cpp:36:18: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     else if(a[2] < v[a[0]].size() && a[3] == v[a[1]].size())
swaps.cpp:36:43: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     else if(a[2] < v[a[0]].size() && a[3] == v[a[1]].size())
swaps.cpp:38:17: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |      while(a[2] < v[a[0]].size())
swaps.cpp:42:18: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     else if(a[2] == v[a[0]].size() && a[3] < v[a[1]].size())
swaps.cpp:42:44: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     else if(a[2] == v[a[0]].size() && a[3] < v[a[1]].size())
swaps.cpp:44:17: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |      while(a[3] < v[a[1]].size())
swaps.cpp:56:13: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     if(a[2] < v[a[0]].size() && a[3] < v[a[1]].size())
swaps.cpp:56:38: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     if(a[2] < v[a[0]].size() && a[3] < v[a[1]].size())
swaps.cpp:62:14: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |      if(a[2] == v[a[0]].size() && a[3] == (int)(v[a[1]].size()) - 1)
swaps.cpp:64:19: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |      else if(a[3] == v[a[1]].size() && a[2] == (int)(v[a[0]].size()) - 1)
swaps.cpp:91:17: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     ok &= (a[2] == v[a[0]].size() && a[3] == v[a[1]].size()) ;
swaps.cpp:91:43: warning: comparison of integer expressions of different signedness: 'std::array<int, 4>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     ok &= (a[2] == v[a[0]].size() && a[3] == v[a[1]].size()) ;

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Correct
2 Correct 2 ms 208 KB Correct
3 Correct 5 ms 208 KB Correct
4 Correct 7 ms 336 KB Correct
5 Correct 8 ms 336 KB Correct
6 Correct 10 ms 336 KB Correct
7 Correct 10 ms 336 KB Correct
8 Correct 10 ms 336 KB Correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Correct
2 Correct 2 ms 208 KB Correct
3 Correct 3 ms 208 KB Correct
4 Correct 5 ms 344 KB Correct
5 Correct 10 ms 336 KB Correct
6 Correct 7 ms 336 KB Correct
7 Correct 9 ms 336 KB Correct
8 Correct 8 ms 336 KB Correct
9 Runtime error 10 ms 352 KB Execution killed with signal 13
10 Halted 0 ms 0 KB -

Subtask #3-1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #3-2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #4-1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #4-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #5-1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #5-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #6-1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #6-2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #7-1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #7-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -