oj.uz

Submission #122944

# Submission time Handle Problem Language Result Execution time Memory
122944 2019-06-29T15:34:09 Z onjo0127 Amusement Park (JOI17_amusement_park) C++17
0 / 100
 23 ms 2240 KB 
#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;

void Joi(int N, int M, int A[], int B[], long long X, int T) {
	for(int i=0; i<N; i++) MessageBoard(i, (X >> (i%60)) & 1);
}

#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

static int move(int x) {
	// printf("dest: %d\n", x);
	return Move(x);
}

static long long ret = 0;

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
	int xx = V;
	while(P % 60 || P + 60 > N) xx = move(--P);
	for(int i=0; i<60; i++) {
		ret |= (xx << i);
		if(i+1 < 60) xx = move(++P);
	}
	return ret;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 888 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 2120 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 768 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 2240 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 2120 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -