oj.uz

Submission #534521

# Submission time Handle Problem Language Result Execution time Memory
534521 2022-03-08T08:40:12 Z NhatMinh0208 The Collection Game (BOI21_swaps) C++14
50 / 100
 61 ms 484 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
// template<typename T>
// __attribute__((always_inline)) void chkmin(T& a, const T& b) {
//     a=(a<b)?a:b;
// }

// template<typename T>
// __attribute__((always_inline)) void chkmax(T& a, const T& b) {
//     a=(a>b)?a:b;
// }
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

#include "swaps.h"

void solve(int n, int v) {
	vector<int> sus;
	vector<int> res;
	for (int i=1;i<=n;i++) sus.push_back(i);
	for (int t=0;t<n;t++) {
		for (int i=t&1;i+1<n;i+=2) schedule(sus[i],sus[i+1]);
		res=visit();
		for (int i=t&1;i+1<n;i+=2) if (!res[i/2]) swap(sus[i],sus[i+1]);
	}
	answer(sus);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 4 ms 200 KB Correct
3 Correct 17 ms 200 KB Correct
4 Correct 47 ms 300 KB Correct
5 Correct 47 ms 304 KB Correct
6 Correct 44 ms 324 KB Correct
7 Correct 50 ms 296 KB Correct
8 Correct 61 ms 296 KB Correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 4 ms 200 KB Correct
3 Correct 15 ms 200 KB Correct
4 Correct 44 ms 360 KB Correct
5 Correct 44 ms 360 KB Correct
6 Correct 48 ms 296 KB Correct
7 Correct 49 ms 484 KB Correct
8 Correct 42 ms 320 KB Correct
9 Correct 53 ms 412 KB Correct
10 Correct 59 ms 288 KB Correct
11 Correct 39 ms 404 KB Correct
12 Correct 46 ms 280 KB Correct
13 Correct 55 ms 388 KB Correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 6 ms 200 KB Correct

Subtask #4
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 6 ms 200 KB Correct
3 Correct 1 ms 200 KB Correct
4 Correct 5 ms 200 KB Correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 3 ms 200 KB Correct
3 Correct 14 ms 200 KB Correct
4 Correct 48 ms 292 KB Correct

Subtask #6
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 3 ms 200 KB Correct
3 Correct 14 ms 200 KB Correct
4 Correct 48 ms 292 KB Correct
5 Correct 1 ms 200 KB Correct
6 Correct 4 ms 200 KB Correct
7 Correct 18 ms 200 KB Correct
8 Correct 52 ms 304 KB Correct
9 Correct 53 ms 292 KB Correct
10 Correct 50 ms 384 KB Correct
11 Correct 48 ms 304 KB Correct
12 Correct 50 ms 300 KB Correct
13 Correct 1 ms 200 KB Correct
14 Correct 3 ms 200 KB Correct
15 Correct 11 ms 284 KB Correct
16 Correct 53 ms 312 KB Correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 3 ms 200 KB Correct
3 Correct 13 ms 200 KB Correct
4 Correct 45 ms 300 KB Correct
5 Correct 56 ms 388 KB Correct

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 3 ms 200 KB Correct
3 Correct 13 ms 200 KB Correct
4 Correct 45 ms 300 KB Correct
5 Correct 56 ms 388 KB Correct
6 Correct 1 ms 200 KB Correct
7 Correct 4 ms 200 KB Correct
8 Correct 14 ms 200 KB Correct
9 Correct 44 ms 296 KB Correct
10 Correct 47 ms 296 KB Correct
11 Correct 61 ms 300 KB Correct
12 Correct 52 ms 388 KB Correct
13 Correct 53 ms 300 KB Correct
14 Correct 50 ms 300 KB Correct
15 Correct 55 ms 384 KB Correct
16 Correct 46 ms 300 KB Correct
17 Correct 53 ms 296 KB Correct
18 Correct 44 ms 300 KB Correct
19 Correct 1 ms 200 KB Correct
20 Correct 3 ms 200 KB Correct
21 Correct 15 ms 200 KB Correct
22 Correct 52 ms 296 KB Correct
23 Correct 50 ms 284 KB Correct

Subtask #9
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 5 ms 200 KB Correct
3 Correct 16 ms 200 KB Correct
4 Correct 43 ms 296 KB Correct
5 Correct 48 ms 280 KB Correct
6 Runtime error 10 ms 280 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 5 ms 200 KB Correct
3 Correct 16 ms 200 KB Correct
4 Correct 43 ms 296 KB Correct
5 Correct 48 ms 280 KB Correct
6 Runtime error 10 ms 280 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 3 ms 200 KB Correct
3 Correct 14 ms 200 KB Correct
4 Correct 51 ms 300 KB Correct
5 Correct 60 ms 280 KB Correct
6 Runtime error 14 ms 408 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -

Subtask #12
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 3 ms 200 KB Correct
3 Correct 14 ms 200 KB Correct
4 Correct 51 ms 300 KB Correct
5 Correct 60 ms 280 KB Correct
6 Runtime error 14 ms 408 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -