답안 #249819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
249819	2020-07-15T21:19:18 Z	Blagojce	Broken Device (JOI17_broken_device)	C++11	41 / 100	52 ms	3584 KB

Anna

#include <bits/stdc++.h> 
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,ll> pii;

const int i_inf = 1e9;
const ll inf = 1e18;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;
 
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 5e5;

#include "Annalib.h"

void Anna(int N, long long X, int K, int P[]){
	bool ok[150];
	memset(ok, false, sizeof(ok));
	fr(i, 0, K) ok[P[i]] = true;
	
	fr(i, 0, 75){
		if(!ok[i] && !ok[i+75]){
			Set(i, 1);
		}
		else{
			Set(i, 0);
		}
	}
	int tmp = 0;
	fr(i, 0, 75){
		if(tmp>60){
			Set(i+75, 0);
			continue;
		}
		if(!ok[i]&&!ok[i+75]){
			if(X&(1LL<<tmp)){
				Set(i+75, 1);
			}
			else{
				Set(i+75, 0);
			}
			tmp ++;
		}
		else{
			Set(i+75, 0);
		}
	}
}

Bruno

#include <bits/stdc++.h> 
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,ll> pii;

const int i_inf = 1e9;
const ll inf = 1e18;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;
 
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 5e5;

#include "Brunolib.h"

long long Bruno( int N, int A[]){
	vector<int> pos;
	fr(i, 0, 75) if(A[i] == 1) pos.pb(i+75);
	ll ret = 0;
	fr(i, 0, pos.size()){
		if(A[pos[i]] == 1) ret |= (1LL<<i);
	}
	
	
	return ret;
}

Compilation message

Bruno.cpp: In function 'long long int Bruno(int, int*)':
Bruno.cpp:2:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fr(i, n, m) for(int i = (n); i < (m); i ++)
                                        ^
Bruno.cpp:32:2: note: in expansion of macro 'fr'
  fr(i, 0, pos.size()){
  ^~

Subtask #1

41.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	38 ms	3312 KB	Output is partially correct - L* = 15
2	Partially correct	38 ms	3328 KB	Output is partially correct - L* = 15
3	Partially correct	38 ms	3328 KB	Output is partially correct - L* = 15
4	Partially correct	39 ms	3328 KB	Output is partially correct - L* = 15
5	Partially correct	39 ms	3312 KB	Output is partially correct - L* = 15
6	Partially correct	39 ms	3328 KB	Output is partially correct - L* = 15
7	Partially correct	40 ms	3568 KB	Output is partially correct - L* = 15
8	Partially correct	39 ms	3312 KB	Output is partially correct - L* = 15
9	Partially correct	40 ms	3312 KB	Output is partially correct - L* = 15
10	Partially correct	39 ms	3328 KB	Output is partially correct - L* = 15
11	Partially correct	43 ms	3320 KB	Output is partially correct - L* = 15
12	Partially correct	39 ms	3312 KB	Output is partially correct - L* = 15
13	Partially correct	39 ms	3312 KB	Output is partially correct - L* = 15
14	Partially correct	38 ms	3312 KB	Output is partially correct - L* = 15
15	Partially correct	38 ms	3312 KB	Output is partially correct - L* = 15
16	Partially correct	40 ms	3312 KB	Output is partially correct - L* = 15
17	Partially correct	47 ms	3312 KB	Output is partially correct - L* = 15
18	Partially correct	45 ms	3312 KB	Output is partially correct - L* = 15
19	Partially correct	40 ms	3328 KB	Output is partially correct - L* = 15
20	Partially correct	40 ms	3328 KB	Output is partially correct - L* = 15
21	Partially correct	39 ms	3328 KB	Output is partially correct - L* = 15
22	Partially correct	48 ms	3312 KB	Output is partially correct - L* = 15
23	Partially correct	47 ms	3312 KB	Output is partially correct - L* = 15
24	Partially correct	39 ms	3328 KB	Output is partially correct - L* = 15
25	Partially correct	40 ms	3312 KB	Output is partially correct - L* = 15
26	Partially correct	40 ms	3312 KB	Output is partially correct - L* = 15
27	Partially correct	39 ms	3328 KB	Output is partially correct - L* = 15
28	Partially correct	52 ms	3312 KB	Output is partially correct - L* = 15
29	Partially correct	40 ms	3328 KB	Output is partially correct - L* = 15
30	Partially correct	39 ms	3312 KB	Output is partially correct - L* = 15
31	Partially correct	38 ms	3328 KB	Output is partially correct - L* = 15
32	Partially correct	39 ms	3328 KB	Output is partially correct - L* = 15
33	Partially correct	38 ms	3312 KB	Output is partially correct - L* = 15
34	Partially correct	39 ms	3328 KB	Output is partially correct - L* = 15
35	Partially correct	39 ms	3328 KB	Output is partially correct - L* = 15
36	Partially correct	38 ms	3320 KB	Output is partially correct - L* = 15
37	Partially correct	39 ms	3312 KB	Output is partially correct - L* = 15
38	Partially correct	39 ms	3312 KB	Output is partially correct - L* = 15
39	Partially correct	43 ms	3584 KB	Output is partially correct - L* = 15
40	Partially correct	39 ms	3384 KB	Output is partially correct - L* = 15