oj.uz

Submission #558002

# Submission time Handle Problem Language Result Execution time Memory
558002 2022-05-06T13:06:31 Z AdamGS The Collection Game (BOI21_swaps) C++17
21 / 100
 494 ms 564 KB 
#include "swaps.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=507;
int T[LIM];
void solve(int n, int v) {
	rep(i, n) T[i]=i;
	while(v--) {
		vector<pair<int,int>>V;
		for(int i=v%2; i+1<n; i+=2) {
			schedule(T[i]+1, T[i+1]+1);
			V.pb({i, i+1});
		}
		vector<int>P=visit();
		rep(i, P.size()) if(!P[i]) swap(T[V[i].st], T[V[i].nd]);
	}
	vector<int>ans;
	rep(i, n) rep(j, n) if(T[j]==i) ans.pb(i+1);
	answer(ans);
}

Compilation message

swaps.cpp: In function 'void solve(int, int)':
swaps.cpp:6:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
swaps.cpp:22:3: note: in expansion of macro 'rep'
   22 |   rep(i, P.size()) if(!P[i]) swap(T[V[i].st], T[V[i].nd]);
      |   ^~~

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 10.0

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

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 208 KB Correct
2 Correct 129 ms 208 KB Correct

Subtask #4
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 208 KB Correct
2 Correct 129 ms 208 KB Correct
3 Incorrect 49 ms 208 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 208 KB Correct
2 Correct 121 ms 208 KB Correct
3 Correct 241 ms 208 KB Correct
4 Correct 474 ms 540 KB Correct

Subtask #6
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 208 KB Correct
2 Correct 121 ms 208 KB Correct
3 Correct 241 ms 208 KB Correct
4 Correct 474 ms 540 KB Correct
5 Incorrect 52 ms 208 KB Not correct
6 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 208 KB Correct
2 Correct 112 ms 208 KB Correct
3 Correct 259 ms 208 KB Correct
4 Correct 493 ms 564 KB Correct
5 Correct 43 ms 300 KB Correct

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 208 KB Correct
2 Correct 112 ms 208 KB Correct
3 Correct 259 ms 208 KB Correct
4 Correct 493 ms 564 KB Correct
5 Correct 43 ms 300 KB Correct
6 Incorrect 49 ms 208 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #9
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 208 KB Correct
2 Correct 111 ms 208 KB Correct
3 Correct 247 ms 208 KB Correct
4 Correct 494 ms 464 KB Correct
5 Correct 49 ms 304 KB Correct
6 Incorrect 9 ms 292 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 208 KB Correct
2 Correct 111 ms 208 KB Correct
3 Correct 247 ms 208 KB Correct
4 Correct 494 ms 464 KB Correct
5 Correct 49 ms 304 KB Correct
6 Incorrect 9 ms 292 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 208 KB Correct
2 Correct 116 ms 208 KB Correct
3 Correct 248 ms 208 KB Correct
4 Correct 459 ms 412 KB Correct
5 Correct 56 ms 304 KB Correct
6 Incorrect 11 ms 288 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #12
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 208 KB Correct
2 Correct 116 ms 208 KB Correct
3 Correct 248 ms 208 KB Correct
4 Correct 459 ms 412 KB Correct
5 Correct 56 ms 304 KB Correct
6 Incorrect 11 ms 288 KB Not correct
7 Halted 0 ms 0 KB -