oj.uz

답안 #411845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
411845 2021-05-26T06:16:59 Z alishahali1382 Broken Device (JOI17_broken_device) C++14
0 / 100
 50 ms 2716 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=210, LOG=60;

bool bad[MAXN];

void Anna(int n, ll x, int k, int P[]){
	for (int i=0; i<k; i++) bad[P[i]]=1;
	for (int i=0; i<n; i+=2){
		if (bad[i] || bad[i+1]){
			Set(i, 0);
			Set(i+1, 0);
		}
		else{
			Set(i, 1);
			Set(i+1, x&1);
			x>>=1;
		}
	}
	return ;
}

#include "Brunolib.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=210, LOG=60;

ll Bruno(int n, int A[]){
	int pos=0;
	ll res=0;
	for (int i=0; i<n; i+=2){
		if (!A[i]) continue ;
		if (A[i+1]) res|=(1<<pos);
		pos++;
	}
	return res;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 41 ms 2556 KB Output isn't correct - L* = 0
2 Partially correct 39 ms 2432 KB Output isn't correct - L* = 0
3 Partially correct 38 ms 2404 KB Output isn't correct - L* = 0
4 Partially correct 39 ms 2540 KB Output isn't correct - L* = 0
5 Partially correct 39 ms 2528 KB Output isn't correct - L* = 0
6 Partially correct 41 ms 2496 KB Output isn't correct - L* = 0
7 Partially correct 39 ms 2544 KB Output isn't correct - L* = 0
8 Partially correct 37 ms 2444 KB Output isn't correct - L* = 0
9 Partially correct 46 ms 2596 KB Output isn't correct - L* = 0
10 Partially correct 38 ms 2516 KB Output isn't correct - L* = 0
11 Partially correct 38 ms 2536 KB Output isn't correct - L* = 0
12 Partially correct 38 ms 2568 KB Output isn't correct - L* = 0
13 Partially correct 38 ms 2508 KB Output isn't correct - L* = 0
14 Partially correct 37 ms 2528 KB Output isn't correct - L* = 0
15 Partially correct 38 ms 2416 KB Output isn't correct - L* = 0
16 Partially correct 38 ms 2448 KB Output isn't correct - L* = 0
17 Partially correct 40 ms 2372 KB Output isn't correct - L* = 0
18 Partially correct 38 ms 2516 KB Output isn't correct - L* = 0
19 Partially correct 39 ms 2412 KB Output isn't correct - L* = 0
20 Partially correct 38 ms 2548 KB Output isn't correct - L* = 0
21 Partially correct 39 ms 2524 KB Output isn't correct - L* = 0
22 Partially correct 38 ms 2536 KB Output isn't correct - L* = 0
23 Partially correct 39 ms 2440 KB Output isn't correct - L* = 0
24 Partially correct 44 ms 2532 KB Output isn't correct - L* = 0
25 Partially correct 41 ms 2516 KB Output isn't correct - L* = 0
26 Partially correct 45 ms 2512 KB Output isn't correct - L* = 0
27 Partially correct 50 ms 2404 KB Output isn't correct - L* = 0
28 Partially correct 38 ms 2572 KB Output isn't correct - L* = 0
29 Partially correct 38 ms 2444 KB Output isn't correct - L* = 0
30 Partially correct 38 ms 2448 KB Output isn't correct - L* = 0
31 Partially correct 43 ms 2716 KB Output isn't correct - L* = 0
32 Partially correct 38 ms 2472 KB Output isn't correct - L* = 0
33 Partially correct 40 ms 2452 KB Output isn't correct - L* = 0
34 Partially correct 38 ms 2540 KB Output isn't correct - L* = 0
35 Partially correct 38 ms 2452 KB Output isn't correct - L* = 0
36 Partially correct 40 ms 2540 KB Output isn't correct - L* = 0
37 Partially correct 38 ms 2456 KB Output isn't correct - L* = 0
38 Partially correct 39 ms 2452 KB Output isn't correct - L* = 0
39 Partially correct 40 ms 2500 KB Output isn't correct - L* = 0
40 Partially correct 38 ms 2448 KB Output isn't correct - L* = 0