oj.uz

답안 #123019

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
123019 2019-06-30T02:59:57 Z onjo0127 Amusement Park (JOI17_amusement_park) C++14
10 / 100
 25 ms 2248 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)) & 1LL);
}
#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
 
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) {
	long long xx = V;
	while(P % 60 || P + 60 > N) xx = move(--P);
	for(int i=0; i<60; i++) {
		if(xx) ret += (xx << i);
		if(i+1 < 60) xx = move(++P);
	}
	return ret;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 888 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 2248 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 888 KB Output is correct
2 Correct 4 ms 880 KB Output is correct
3 Correct 4 ms 752 KB Output is correct
4 Correct 5 ms 944 KB Output is correct
5 Correct 6 ms 912 KB Output is correct
6 Correct 5 ms 940 KB Output is correct
7 Correct 5 ms 784 KB Output is correct
8 Correct 5 ms 912 KB Output is correct
9 Correct 13 ms 1600 KB Output is correct
10 Correct 13 ms 1520 KB Output is correct
11 Correct 12 ms 1708 KB Output is correct
12 Correct 4 ms 892 KB Output is correct
13 Correct 4 ms 752 KB Output is correct
14 Correct 4 ms 996 KB Output is correct
15 Correct 4 ms 880 KB Output is correct

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 2120 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 2244 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -