답안 #345852

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345852	2021-01-08T10:15:11 Z	kshitij_sodani	Broken Device (JOI17_broken_device)	C++14	61 / 100	47 ms	3000 KB

Anna

//#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;		
	}
	vector<int> kk;
	for(int i=0;i<n;i++){
		if(vis[i]==0){
			kk.pb(i);
		}
	}
	int cot=0;
	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){
					ans[i]=1;
					cur++;
					la=i;
					continue;
					/*if(i%2==0){
						ans[i]=1;
						cur++;
					}*/
					continue;
				}
				if(x&(1LL<<cur)){
					if((i-la+cur/2)%2==1){
						le-=(1LL<<cur);
						ans[i]=1;
						cur++;
						la=i;
					}
				}
				else{
					if((i-la+cur/2)%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] );
	  	}
*/
	 
}

Bruno

//#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;
	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++){
			if((ss[i]-ss[i-1]+(i-1)/2)%2==1){
				ans+=(1LL<<(i-1));
			}
		}
	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

Anna.cpp: In function 'void Anna(int, long long int, int, int*)':
Anna.cpp:29:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  while(cot<kk.size()){
      |        ~~~^~~~~~~~~~

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

Subtask #1

61.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	44 ms	2708 KB	Output is partially correct - L* = 31
2	Partially correct	41 ms	2620 KB	Output is partially correct - L* = 30
3	Partially correct	47 ms	2688 KB	Output is partially correct - L* = 33
4	Partially correct	40 ms	2492 KB	Output is partially correct - L* = 29
5	Partially correct	45 ms	2720 KB	Output is partially correct - L* = 31
6	Partially correct	45 ms	2492 KB	Output is partially correct - L* = 30
7	Partially correct	41 ms	2492 KB	Output is partially correct - L* = 31
8	Partially correct	41 ms	2664 KB	Output is partially correct - L* = 27
9	Partially correct	43 ms	3000 KB	Output is partially correct - L* = 28
10	Partially correct	41 ms	2492 KB	Output is partially correct - L* = 32
11	Partially correct	43 ms	2696 KB	Output is partially correct - L* = 31
12	Partially correct	44 ms	2492 KB	Output is partially correct - L* = 28
13	Partially correct	41 ms	2816 KB	Output is partially correct - L* = 31
14	Partially correct	41 ms	2688 KB	Output is partially correct - L* = 30
15	Partially correct	41 ms	2492 KB	Output is partially correct - L* = 36
16	Partially correct	41 ms	2740 KB	Output is partially correct - L* = 31
17	Partially correct	43 ms	2492 KB	Output is partially correct - L* = 31
18	Partially correct	41 ms	2620 KB	Output is partially correct - L* = 32
19	Partially correct	41 ms	2688 KB	Output is partially correct - L* = 32
20	Partially correct	41 ms	2696 KB	Output is partially correct - L* = 29
21	Partially correct	41 ms	2620 KB	Output is partially correct - L* = 30
22	Partially correct	40 ms	2620 KB	Output is partially correct - L* = 29
23	Partially correct	45 ms	2688 KB	Output is partially correct - L* = 28
24	Partially correct	41 ms	2620 KB	Output is partially correct - L* = 32
25	Partially correct	41 ms	2492 KB	Output is partially correct - L* = 29
26	Partially correct	43 ms	2728 KB	Output is partially correct - L* = 34
27	Partially correct	44 ms	2492 KB	Output is partially correct - L* = 32
28	Partially correct	41 ms	2492 KB	Output is partially correct - L* = 30
29	Partially correct	41 ms	2580 KB	Output is partially correct - L* = 25
30	Partially correct	43 ms	2492 KB	Output is partially correct - L* = 30
31	Partially correct	43 ms	2764 KB	Output is partially correct - L* = 36
32	Partially correct	41 ms	2688 KB	Output is partially correct - L* = 30
33	Partially correct	41 ms	2620 KB	Output is partially correct - L* = 35
34	Partially correct	43 ms	2492 KB	Output is partially correct - L* = 29
35	Partially correct	41 ms	2492 KB	Output is partially correct - L* = 30
36	Partially correct	41 ms	2620 KB	Output is partially correct - L* = 29
37	Partially correct	41 ms	2696 KB	Output is partially correct - L* = 32
38	Partially correct	41 ms	2492 KB	Output is partially correct - L* = 29
39	Partially correct	43 ms	2620 KB	Output is partially correct - L* = 28
40	Partially correct	43 ms	2688 KB	Output is partially correct - L* = 26