# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122943 | onjo0127 | Amusement Park (JOI17_amusement_park) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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);
}
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;
}