Submission #345839

#TimeUsernameProblemLanguageResultExecution timeMemory
345839kshitij_sodaniBroken Device (JOI17_broken_device)C++14
45 / 100
45 ms3116 KiB
//#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];
void Anna( int n, long long x, int k, int pp[] ){
	for(int i=0;i<n;i++){
		vis[i]=0;
		ans[i]=0;
	}
	for(int i=0;i<k;i++){
		vis[pp[i]]=1;		
	}
	int cur=0;
	for(int i=0;i<n;i++){
		if(cur==60){
			break;
		}
		if(vis[i]==0){
			if(x&(1LL<<cur)){
				if(i%2==1){
					ans[i]=1;
					cur++;
				}
			}
			else{
				if(i%2==0){
					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"

long long Bruno( int n, int aa[] ){


	vector<int> ss;
	llo ans=0;
	for(int i=0;i<n;i++){
		if(aa[i]==1){
			ss.pb(i);
		}
	}
	for(int i=0;i<ss.size();i++){
		if((ss[i]%2==1)){
			ans+=(1LL<<i);
		}
	}




  return ans;
}

//g++ -std=c++14 -O2 -o aa grader.cpp Anna.cpp Bruno.cpp

Compilation message (stderr)

Bruno.cpp: In function 'long long int Bruno(int, int*)':
Bruno.cpp:24:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |  for(int i=0;i<ss.size();i++){
      |              ~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...