Submission #643608

# Submission time Handle Problem Language Result Execution time Memory
643608 2022-09-22T15:41:36 Z gs14004 Broken Device 2 (JOI22_device2) C++17
80 / 100
98 ms 3616 KB
#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<lint, lint>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()

namespace {

int variable_example = 0;

}

int Declare() {
  variable_example++;
  return 180;
}

std::pair<std::vector<int>, std::vector<int> > Anna(long long A) {
	vector<int> X, Y;
	for(int i = 0; i < 60; i++){
		for(int j = 0; j < 3; j++) X.push_back((A >> i) & 1);
	}
	for(int i = 0; i < 180; i++){
		Y.push_back((i + 1) % 2);
	}
	return make_pair(X, Y);
}
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<lint, lint>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()

namespace {

int variable_example = 0;

}

long long Bruno(std::vector<int> u) {
	int ptr = 0;
	int sum = 0;
	vector<int> ans;
	while(ptr < sz(u)){
		int k = sum - (sum % 3 + 3) % 3;
		while(ptr < sz(u)){
			sum += u[ptr++] * 2 - 1;
			if(sum >= k + 3) break;
			if(sum <= k - 2) break;
		}
		if(sum >= k + 3) ans.push_back(1);
		else if(sum <= k - 2) ans.push_back(0);
	}
	assert(sz(ans) == 60);
	lint dap = 0;
	for(int i = 0; i < 60; i++) if(ans[i]) dap |= (1ll << i);
	return dap;
}

Compilation message

Bruno.cpp:11:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
   11 | int variable_example = 0;
      |     ^~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 69 ms 3428 KB Output is correct
3 Correct 71 ms 3328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 69 ms 3428 KB Output is correct
3 Correct 71 ms 3328 KB Output is correct
4 Correct 73 ms 3440 KB Output is correct
5 Correct 77 ms 3444 KB Output is correct
6 Correct 71 ms 3396 KB Output is correct
7 Correct 71 ms 3460 KB Output is correct
8 Correct 71 ms 3460 KB Output is correct
9 Correct 74 ms 3524 KB Output is correct
10 Correct 71 ms 3616 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 69 ms 3428 KB Output is correct
3 Correct 71 ms 3328 KB Output is correct
4 Correct 73 ms 3440 KB Output is correct
5 Correct 77 ms 3444 KB Output is correct
6 Correct 71 ms 3396 KB Output is correct
7 Correct 71 ms 3460 KB Output is correct
8 Correct 71 ms 3460 KB Output is correct
9 Correct 74 ms 3524 KB Output is correct
10 Correct 71 ms 3616 KB Output is correct
11 Correct 72 ms 3400 KB Output is correct
12 Correct 75 ms 3492 KB Output is correct
13 Correct 74 ms 3420 KB Output is correct
14 Correct 78 ms 3328 KB Output is correct
15 Correct 74 ms 3372 KB Output is correct
16 Correct 73 ms 3336 KB Output is correct
17 Correct 71 ms 3412 KB Output is correct
18 Correct 93 ms 3404 KB Output is correct
19 Correct 72 ms 3444 KB Output is correct
20 Correct 72 ms 3332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 69 ms 3428 KB Output is correct
3 Correct 71 ms 3328 KB Output is correct
4 Correct 73 ms 3440 KB Output is correct
5 Correct 77 ms 3444 KB Output is correct
6 Correct 71 ms 3396 KB Output is correct
7 Correct 71 ms 3460 KB Output is correct
8 Correct 71 ms 3460 KB Output is correct
9 Correct 74 ms 3524 KB Output is correct
10 Correct 71 ms 3616 KB Output is correct
11 Correct 72 ms 3400 KB Output is correct
12 Correct 75 ms 3492 KB Output is correct
13 Correct 74 ms 3420 KB Output is correct
14 Correct 78 ms 3328 KB Output is correct
15 Correct 74 ms 3372 KB Output is correct
16 Correct 73 ms 3336 KB Output is correct
17 Correct 71 ms 3412 KB Output is correct
18 Correct 93 ms 3404 KB Output is correct
19 Correct 72 ms 3444 KB Output is correct
20 Correct 72 ms 3332 KB Output is correct
21 Correct 84 ms 3536 KB Output is correct
22 Correct 88 ms 3508 KB Output is correct
23 Correct 76 ms 3488 KB Output is correct
24 Correct 75 ms 3368 KB Output is correct
25 Correct 77 ms 3472 KB Output is correct
26 Correct 77 ms 3364 KB Output is correct
27 Correct 84 ms 3396 KB Output is correct
28 Correct 73 ms 3396 KB Output is correct
29 Correct 75 ms 3472 KB Output is correct
30 Correct 82 ms 3464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 69 ms 3428 KB Output is correct
3 Correct 71 ms 3328 KB Output is correct
4 Correct 73 ms 3440 KB Output is correct
5 Correct 77 ms 3444 KB Output is correct
6 Correct 71 ms 3396 KB Output is correct
7 Correct 71 ms 3460 KB Output is correct
8 Correct 71 ms 3460 KB Output is correct
9 Correct 74 ms 3524 KB Output is correct
10 Correct 71 ms 3616 KB Output is correct
11 Correct 72 ms 3400 KB Output is correct
12 Correct 75 ms 3492 KB Output is correct
13 Correct 74 ms 3420 KB Output is correct
14 Correct 78 ms 3328 KB Output is correct
15 Correct 74 ms 3372 KB Output is correct
16 Correct 73 ms 3336 KB Output is correct
17 Correct 71 ms 3412 KB Output is correct
18 Correct 93 ms 3404 KB Output is correct
19 Correct 72 ms 3444 KB Output is correct
20 Correct 72 ms 3332 KB Output is correct
21 Correct 84 ms 3536 KB Output is correct
22 Correct 88 ms 3508 KB Output is correct
23 Correct 76 ms 3488 KB Output is correct
24 Correct 75 ms 3368 KB Output is correct
25 Correct 77 ms 3472 KB Output is correct
26 Correct 77 ms 3364 KB Output is correct
27 Correct 84 ms 3396 KB Output is correct
28 Correct 73 ms 3396 KB Output is correct
29 Correct 75 ms 3472 KB Output is correct
30 Correct 82 ms 3464 KB Output is correct
31 Correct 74 ms 3420 KB Output is correct
32 Correct 87 ms 3388 KB Output is correct
33 Correct 76 ms 3480 KB Output is correct
34 Correct 77 ms 3500 KB Output is correct
35 Correct 92 ms 3468 KB Output is correct
36 Correct 78 ms 3392 KB Output is correct
37 Correct 87 ms 3440 KB Output is correct
38 Correct 75 ms 3436 KB Output is correct
39 Correct 75 ms 3404 KB Output is correct
40 Correct 89 ms 3404 KB Output is correct
# Verdict Execution time Memory Grader output
1 Partially correct 80 ms 3440 KB Output is partially correct
2 Partially correct 85 ms 3552 KB Output is partially correct
3 Partially correct 79 ms 3556 KB Output is partially correct
4 Partially correct 86 ms 3388 KB Output is partially correct
5 Partially correct 98 ms 3496 KB Output is partially correct
6 Partially correct 78 ms 3552 KB Output is partially correct
7 Partially correct 74 ms 3348 KB Output is partially correct
8 Partially correct 91 ms 3364 KB Output is partially correct
9 Partially correct 81 ms 3448 KB Output is partially correct
10 Partially correct 86 ms 3472 KB Output is partially correct
11 Partially correct 97 ms 3352 KB Output is partially correct
12 Partially correct 79 ms 3440 KB Output is partially correct
13 Partially correct 77 ms 3480 KB Output is partially correct
14 Partially correct 69 ms 3468 KB Output is partially correct
15 Partially correct 77 ms 3516 KB Output is partially correct
16 Partially correct 76 ms 3440 KB Output is partially correct
17 Partially correct 80 ms 3504 KB Output is partially correct
18 Partially correct 74 ms 3484 KB Output is partially correct
19 Partially correct 80 ms 3396 KB Output is partially correct
20 Partially correct 77 ms 3416 KB Output is partially correct