oj.uz

Submission #726872

# Submission time Handle Problem Language Result Execution time Memory
726872 2023-04-19T13:16:49 Z gagik_2007 The Collection Game (BOI21_swaps) C++17
21 / 100
 63 ms 456 KB 
#include "swaps.h"
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <chrono>
#include <ctime>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <limits>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <functional>
#include <random>
#include <cassert>
using namespace std;

typedef long long ll;
typedef long double ld;

#define ff first
#define ss second

ll ttt;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll N = 200007;
ll n, m;
bool used[N];

void solve(int NN, int VV) {
	vector<int>p;
	n = NN;
	if (n == 1) {
		answer({ 1 });
		return;
	}
	for (int i = 1; i <= n; i++) {
		p.push_back(i);
	}
	int cl = 1;
	for (int c = 0; c < n; c++) {
		int l = cl;
		while (l + 1 <= n) {
			schedule(l, l + 1);
			l += 2;
		}
		visit();
		if (cl == 2) {
			cl = 1;
		}
		else {
			cl = 2;
		}
	}
	answer(p);
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 1 ms 292 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #3
3.0 / 3.0

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

Subtask #4
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 4 ms 208 KB Correct
3 Incorrect 1 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 1 ms 208 KB Correct
2 Correct 3 ms 208 KB Correct
3 Correct 17 ms 296 KB Correct
4 Correct 63 ms 312 KB Correct

Subtask #6
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 3 ms 208 KB Correct
3 Correct 17 ms 296 KB Correct
4 Correct 63 ms 312 KB Correct
5 Incorrect 1 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 1 ms 208 KB Correct
2 Correct 3 ms 208 KB Correct
3 Correct 11 ms 296 KB Correct
4 Correct 49 ms 324 KB Correct
5 Correct 52 ms 444 KB Correct

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 3 ms 208 KB Correct
3 Correct 11 ms 296 KB Correct
4 Correct 49 ms 324 KB Correct
5 Correct 52 ms 444 KB Correct
6 Incorrect 1 ms 208 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #9
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Correct
2 Correct 3 ms 208 KB Correct
3 Correct 12 ms 208 KB Correct
4 Correct 44 ms 452 KB Correct
5 Correct 43 ms 456 KB Correct
6 Runtime error 9 ms 292 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 0 ms 208 KB Correct
2 Correct 3 ms 208 KB Correct
3 Correct 12 ms 208 KB Correct
4 Correct 44 ms 452 KB Correct
5 Correct 43 ms 456 KB Correct
6 Runtime error 9 ms 292 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 208 KB Correct
2 Correct 4 ms 208 KB Correct
3 Correct 20 ms 208 KB Correct
4 Correct 43 ms 428 KB Correct
5 Correct 41 ms 288 KB Correct
6 Runtime error 9 ms 292 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 208 KB Correct
2 Correct 4 ms 208 KB Correct
3 Correct 20 ms 208 KB Correct
4 Correct 43 ms 428 KB Correct
5 Correct 41 ms 288 KB Correct
6 Runtime error 9 ms 292 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -