oj.uz

Submission #742494

# Submission time Handle Problem Language Result Execution time Memory
742494 2023-05-16T10:30:09 Z penguin133 The Collection Game (BOI21_swaps) C++17
12 / 100
 41 ms 424 KB 
#include <bits/stdc++.h>
using namespace std;

//#define int long long
#include "swaps.h"
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());


int cnt[505], vis[505], stuf[505][505], ans[505];

void dnc(int l, int r){
	if(l >= r)return;
	int mid = (l + r) >> 1;
	dnc(l, mid);
	dnc(mid + 1, r);
	int in1 = l, in2 = mid + 1;
	for(int i = l; i <= mid; i++){
		for(int j = 0; j < (r - mid); j++){
			int x = mid + 1 + j;
			if(i + j <= mid)schedule(i + j, x);
			
		}
		auto ret = visit();
	}
}

void solve(int N, int V) {
   vector <int> brr;
   for(int i=1;i<=N;i++)brr.push_back(i);
   dnc(1, N);
   answer(brr);
}

Compilation message

swaps.cpp: In function 'void dnc(int, int)':
swaps.cpp:23:6: warning: unused variable 'in1' [-Wunused-variable]
   23 |  int in1 = l, in2 = mid + 1;
      |      ^~~
swaps.cpp:23:15: warning: unused variable 'in2' [-Wunused-variable]
   23 |  int in1 = l, in2 = mid + 1;
      |               ^~~

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 208 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 5 ms 316 KB Correct

Subtask #4
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 5 ms 316 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 0 ms 208 KB Correct
2 Correct 6 ms 312 KB Correct
3 Correct 13 ms 208 KB Correct
4 Correct 35 ms 316 KB Correct

Subtask #6
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Correct
2 Correct 6 ms 312 KB Correct
3 Correct 13 ms 208 KB Correct
4 Correct 35 ms 316 KB Correct
5 Incorrect 1 ms 208 KB Not correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 4 ms 316 KB Correct
3 Correct 16 ms 208 KB Correct
4 Correct 41 ms 316 KB Correct
5 Runtime error 5 ms 304 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 4 ms 316 KB Correct
3 Correct 16 ms 208 KB Correct
4 Correct 41 ms 316 KB Correct
5 Runtime error 5 ms 304 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -

Subtask #9
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 6 ms 208 KB Correct
3 Correct 15 ms 424 KB Correct
4 Correct 32 ms 300 KB Correct
5 Runtime error 5 ms 208 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 6 ms 208 KB Correct
3 Correct 15 ms 424 KB Correct
4 Correct 32 ms 300 KB Correct
5 Runtime error 5 ms 208 KB Execution killed with signal 13
6 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 18 ms 292 KB Correct
4 Correct 41 ms 328 KB Correct
5 Runtime error 7 ms 208 KB Execution killed with signal 13
6 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 18 ms 292 KB Correct
4 Correct 41 ms 328 KB Correct
5 Runtime error 7 ms 208 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -