답안 #131561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131561 2019-07-17T09:45:23 Z Mahmoud_Adel Broken Device (JOI17_broken_device) C++14
0 / 100
5 ms 996 KB
#include <bits/stdc++.h>
#include "Annalib.h"

using namespace std;
int mark[151];
void Anna( int n, long long x, int k, int p[] )
{
	for(int i=0; i<k; i++) mark[p[i]] = 1;
	long long cnt = 0;
	for(int i=0; i<n-1; i++)
	{
		if(!mark[i] && !mark[i+1])
		{
			if(x & (1LL<<cnt)) Set(i, 1), Set(i+1, 1);
			else Set(i, 1), Set(i+1, 0);
			cnt++;
			i++;
		}
		else continue;
	}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno( int n, int a[] )
{
	long long x = 0;
	int cnt = 0;
	for(int i=0; i<n-1; i++)
	{
		if(a[i] == 1)
		{
			if(a[i+1]) x |= (1LL<<cnt);
			cnt++;
		}
	}
	return x;
}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 760 KB Wrong Answer [4]
2 Incorrect 4 ms 916 KB Wrong Answer [4]
3 Incorrect 4 ms 860 KB Wrong Answer [4]
4 Incorrect 4 ms 868 KB Wrong Answer [4]
5 Incorrect 4 ms 760 KB Wrong Answer [4]
6 Incorrect 4 ms 860 KB Wrong Answer [4]
7 Incorrect 4 ms 860 KB Wrong Answer [4]
8 Incorrect 4 ms 772 KB Wrong Answer [4]
9 Incorrect 4 ms 632 KB Wrong Answer [4]
10 Incorrect 4 ms 760 KB Wrong Answer [4]
11 Incorrect 4 ms 860 KB Wrong Answer [4]
12 Incorrect 4 ms 760 KB Wrong Answer [4]
13 Incorrect 4 ms 864 KB Wrong Answer [4]
14 Incorrect 4 ms 916 KB Wrong Answer [4]
15 Incorrect 4 ms 860 KB Wrong Answer [4]
16 Incorrect 4 ms 776 KB Wrong Answer [4]
17 Incorrect 4 ms 796 KB Wrong Answer [4]
18 Incorrect 4 ms 768 KB Wrong Answer [4]
19 Incorrect 4 ms 780 KB Wrong Answer [4]
20 Incorrect 4 ms 760 KB Wrong Answer [4]
21 Incorrect 4 ms 772 KB Wrong Answer [4]
22 Incorrect 4 ms 756 KB Wrong Answer [4]
23 Incorrect 4 ms 760 KB Wrong Answer [4]
24 Incorrect 5 ms 768 KB Wrong Answer [4]
25 Incorrect 4 ms 632 KB Wrong Answer [4]
26 Incorrect 4 ms 760 KB Wrong Answer [4]
27 Incorrect 4 ms 888 KB Wrong Answer [4]
28 Incorrect 4 ms 864 KB Wrong Answer [4]
29 Incorrect 4 ms 984 KB Wrong Answer [4]
30 Incorrect 4 ms 632 KB Wrong Answer [4]
31 Incorrect 4 ms 888 KB Wrong Answer [4]
32 Incorrect 4 ms 768 KB Wrong Answer [4]
33 Incorrect 4 ms 760 KB Wrong Answer [4]
34 Incorrect 4 ms 768 KB Wrong Answer [4]
35 Incorrect 4 ms 760 KB Wrong Answer [4]
36 Incorrect 4 ms 996 KB Wrong Answer [4]
37 Incorrect 4 ms 772 KB Wrong Answer [4]
38 Incorrect 4 ms 888 KB Wrong Answer [4]
39 Incorrect 4 ms 760 KB Wrong Answer [4]
40 Incorrect 4 ms 632 KB Wrong Answer [4]