oj.uz

답안 #345967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
345967 2021-01-08T18:52:51 Z kshitij_sodani Broken Device (JOI17_broken_device) C++14
69 / 100
 47 ms 2868 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
 
#include "Annalib.h"
int vis[151];
int ans[151];
/*vector<llo> yy={0,0,0,0,0,0,
	0,0,0,0,0,0,
	0,0,0,0,0,0,
	0,0,0,0,0,0,
	0,0,0,0,0,0,
	0,0,0,0,0,0,
1,1,1,1,1,1,
1,1,1,1,1,1,
1,1,1,1,1,1,
1,1,1,1,1,1};*/
void Anna( int n, long long x, int k, int pp[] ){
	for(int i=0;i<n;i++){
		vis[i]=0;
		ans[i]=0;
	}
	x=x^217328824795767654;
	for(int i=0;i<k;i++){
		vis[pp[i]]=1;		
	}
	vector<int> kk;
	for(int i=0;i<n;i++){
		if(vis[i]==0){
			kk.pb(i);
		}
	}
	int cot=0;
	llo mm=0;
	for(int i=0;i<60;i++){
		if((1LL<<i)&x){
			mm+=1;
		}
	}
	llo st=0;
	if(mm<30){
		st=1;
		x=(1LL<<60)-x-1;
	}
	//while(cot<kk.size()){
		int cur=-1;
		int la=-1;
		for(int i=0;i<n;i++){
			ans[i]=0;
		}
		llo le=x;
		for(int i=0;i<n;i++){
			if(cur==60){
				break;
			}
		/*	if(i<kk[cot]){
				continue;
			}*/
			if(vis[i]==0){
				if(cur==-1){
					if(i%2==st){
						continue;
					}
					ans[i]=1;
					cur++;
					la=i;
					continue;
					/*if(i%2==0){
						ans[i]=1;
						cur++;
					}*/
					continue;
				}
				/*llo xx=0;
				if(cur>=40){
					xx=1;
				}*/
				if(x&(1LL<<cur)){
 
					if((i-la)%2==1){
						le-=(1LL<<cur);
						ans[i]=1;
						cur++;
						la=i;
					}
				}
				else{
					if((i-la)%2==0){
						ans[i]=1;
						cur++;
						la=i;
					}
				}
			}
		}
	/*	if(le==0){
			break;
		}*/
		cot++;
		//if(cur==60){
 
 
	//  }
  		for( int i = 0; i < n; i++ ){
	   		 Set( i, ans[i] );
	  	}
 
 
	  	return;
 
	//}
	/*cur=-1;
	for(int i=0;i<n;i++){
		ans[i]=0;
	}
	for(int i=0;i<n;i++){
		if(cur==60){
			break;
		}
		if(vis[i]==0){
			if(cur==-1){
				if(i%2==1){
					cur++;
					ans[i]=1;
				}
				continue;
			}
			if(x&(1LL<<cur)){
				if(i%2==0){
					ans[i]=1;
					cur++;
				}
			}
			else{
				if(i%2==1){
					ans[i]=1;
					cur++;
				}
			}
		}
	}
 
	 for( int i = 0; i < n; i++ ){
	   		 Set( i, ans[i] );
	  	}
*/
	 
}
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
 
 
#include "Brunolib.h"
/*vector<llo> yy2={0,0,0,0,0,0,
	0,0,0,0,0,0,
	0,0,0,0,0,0,
	0,0,0,0,0,0,
	0,0,0,0,0,0,
	0,0,0,0,0,0,
1,1,1,1,1,1,
1,1,1,1,1,1,
1,1,1,1,1,1,
1,1,1,1,1,1};*/
long long Bruno( int n, int aa[] ){
 
 
	vector<int> ss;
	llo ans=0;
	int x=-1;
	for(int i=0;i<n;i++){
		if(aa[i]==1){
			/*if(x==-1){
				x=i;
				continue;
			}*/
			ss.pb(i);
		}
	}
	for(int i=1;i<ss.size();i++){
		/*llo xx=0;
				if(i-1>=40){
					xx=1;
				}*/
			if((ss[i]-ss[i-1])%2==1){
				ans+=(1LL<<(i-1));
			}
		}
		if(ss[0]%2==0){
			ans=(1LL<<60)-ans-1;
		}
		ans=(ans^217328824795767654);
	return ans;
	if(x%2==0){
		for(int i=0;i<ss.size();i++){
			if((ss[i]%2==1)){
				ans+=(1LL<<i);
			}
		}
	}
	else{
		for(int i=0;i<ss.size();i++){
			if((ss[i]%2==0)){
				ans+=(1LL<<i);
			}
		}
	}
 
 
 
 
  return ans;
}
 
//g++ -std=c++14 -O2 -o aa grader.cpp Anna.cpp Bruno.cpp

Compilation message

Bruno.cpp: In function 'long long int Bruno(int, int*)':
Bruno.cpp:38:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  for(int i=1;i<ss.size();i++){
      |              ~^~~~~~~~~~
Bruno.cpp:53:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for(int i=0;i<ss.size();i++){
      |               ~^~~~~~~~~~
Bruno.cpp:60:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |   for(int i=0;i<ss.size();i++){
      |               ~^~~~~~~~~~

Subtask #1
69.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 42 ms 2696 KB Output is partially correct - L* = 31
2 Partially correct 42 ms 2836 KB Output is partially correct - L* = 30
3 Partially correct 42 ms 2748 KB Output is partially correct - L* = 30
4 Partially correct 42 ms 2620 KB Output is partially correct - L* = 32
5 Partially correct 42 ms 2636 KB Output is partially correct - L* = 31
6 Partially correct 42 ms 2824 KB Output is partially correct - L* = 30
7 Partially correct 44 ms 2688 KB Output is partially correct - L* = 31
8 Partially correct 44 ms 2620 KB Output is partially correct - L* = 33
9 Partially correct 44 ms 2868 KB Output is partially correct - L* = 31
10 Partially correct 45 ms 2584 KB Output is partially correct - L* = 31
11 Partially correct 42 ms 2492 KB Output is partially correct - L* = 33
12 Partially correct 42 ms 2760 KB Output is partially correct - L* = 33
13 Partially correct 47 ms 2688 KB Output is partially correct - L* = 31
14 Partially correct 43 ms 2620 KB Output is partially correct - L* = 33
15 Partially correct 42 ms 2688 KB Output is partially correct - L* = 36
16 Partially correct 42 ms 2620 KB Output is partially correct - L* = 32
17 Partially correct 43 ms 2688 KB Output is partially correct - L* = 31
18 Partially correct 42 ms 2492 KB Output is partially correct - L* = 32
19 Partially correct 42 ms 2492 KB Output is partially correct - L* = 32
20 Partially correct 42 ms 2748 KB Output is partially correct - L* = 29
21 Partially correct 44 ms 2688 KB Output is partially correct - L* = 33
22 Partially correct 42 ms 2492 KB Output is partially correct - L* = 29
23 Partially correct 43 ms 2688 KB Output is partially correct - L* = 32
24 Partially correct 42 ms 2532 KB Output is partially correct - L* = 31
25 Partially correct 47 ms 2492 KB Output is partially correct - L* = 30
26 Partially correct 44 ms 2808 KB Output is partially correct - L* = 34
27 Partially correct 42 ms 2824 KB Output is partially correct - L* = 33
28 Partially correct 42 ms 2644 KB Output is partially correct - L* = 31
29 Partially correct 44 ms 2572 KB Output is partially correct - L* = 33
30 Partially correct 44 ms 2492 KB Output is partially correct - L* = 33
31 Partially correct 42 ms 2688 KB Output is partially correct - L* = 32
32 Partially correct 43 ms 2492 KB Output is partially correct - L* = 32
33 Partially correct 45 ms 2664 KB Output is partially correct - L* = 30
34 Partially correct 43 ms 2492 KB Output is partially correct - L* = 30
35 Partially correct 44 ms 2636 KB Output is partially correct - L* = 32
36 Partially correct 43 ms 2492 KB Output is partially correct - L* = 34
37 Partially correct 44 ms 2620 KB Output is partially correct - L* = 32
38 Partially correct 42 ms 2620 KB Output is partially correct - L* = 29
39 Partially correct 42 ms 2536 KB Output is partially correct - L* = 35
40 Partially correct 43 ms 2696 KB Output is partially correct - L* = 33