oj.uz

답안 #131704

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131704 2019-07-17T13:11:40 Z Mahmoud_Adel Broken Device (JOI17_broken_device) C++14
85 / 100
 77 ms 3312 KB 
#include <bits/stdc++.h>
#include "Annalib.h"
typedef long long ll;
using namespace std;
int mark[151];
ll power(ll x, ll y)
{
	if(y == 0) return 1;
	ll ret = 1;
	while(y--) ret *= x;
	return ret;
}
void Anna(int n, long long x, int k, int p[] )
{
	ll temp = x, cnt = 0;
	memset(mark, 0, sizeof mark);
	for(int i=0; i<k; i++) mark[p[i]] = 1;
	ll a[38];
	for(ll i=37; i>=0; i--)
	{
		if(temp >= power(3, i)*2) temp -= power(3, i)*2, a[i] = 2;
		else if(temp >= power(3, i)) temp -= power(3, i), a[i] = 1;
		else a[i] = 0;
	}
	for(int i=0; i<n; i+=2)
	{
		if(mark[i] || mark[i+1] || cnt > 37) Set(i, 0), Set(i+1, 0);
		else
		{
			if(a[cnt] == 2) Set(i, 1), Set(i+1, 1);
			else if(a[cnt] == 1) Set(i, 1), Set(i+1, 0);
			else Set(i, 0), Set(i+1, 1);
			cnt++;
		}
	}
}

#include "Brunolib.h"
#include <bits/stdc++.h>
//~ #include "Anna.cpp"
//~ #include "grader.cpp"
typedef long long ll;
using namespace std;
ll power(ll x, ll y)
{
	if(y == 0) return 1;
	ll ret = 1;
	while(y--) ret *= x;
	return ret;
}
long long Bruno(int n, int a[] )
{
	ll cnt = 0;
	ll x = 0;
	for(int i=0; i<n; i+=2)
	{
		if(!a[i] && !a[i+1]) continue;
		int b;
		if(a[i] == 1 && a[i+1] == 1) b = 2;
		else if(a[i] == 1) b = 1;
		else b = 0;
		x += b*power(3, cnt++);
	}
	return x;
}

Subtask #1
85.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37
2 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37
3 Partially correct 41 ms 3312 KB Output is partially correct - L* = 37
4 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37
5 Partially correct 46 ms 3056 KB Output is partially correct - L* = 37
6 Partially correct 44 ms 3056 KB Output is partially correct - L* = 37
7 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37
8 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
9 Partially correct 41 ms 3000 KB Output is partially correct - L* = 37
10 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
11 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37
12 Partially correct 44 ms 3056 KB Output is partially correct - L* = 37
13 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
14 Partially correct 46 ms 3056 KB Output is partially correct - L* = 37
15 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37
16 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
17 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
18 Partially correct 44 ms 3056 KB Output is partially correct - L* = 37
19 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
20 Partially correct 41 ms 3048 KB Output is partially correct - L* = 37
21 Partially correct 77 ms 3056 KB Output is partially correct - L* = 37
22 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
23 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37
24 Partially correct 41 ms 3064 KB Output is partially correct - L* = 37
25 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
26 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
27 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37
28 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
29 Partially correct 41 ms 3000 KB Output is partially correct - L* = 37
30 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37
31 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37
32 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
33 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
34 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37
35 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
36 Partially correct 43 ms 2976 KB Output is partially correct - L* = 37
37 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
38 Partially correct 41 ms 3056 KB Output is partially correct - L* = 37
39 Partially correct 44 ms 3056 KB Output is partially correct - L* = 37
40 Partially correct 43 ms 3056 KB Output is partially correct - L* = 37