oj.uz

답안 #419505

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419505 2021-06-07T08:01:37 Z alishahali1382 Ancient Machine (JOI21_ancient_machine) C++17
69 / 100
 77 ms 8264 KB 
#include "Anna.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=100010, LOG=20;

bool A[MAXN];

void Anna(int n, vector<char> S){
	int posx=n;
	for (int i=0; i<n; i++) if (S[i]=='X'){
		posx=i;
		break ;
	}
	for (int i=0; i<17; i++) Send(posx>>i&1);
	// for (int i=0; i<posx; i++) Send(1);
	for (int i=posx; i<n; i++){
		if (S[i]=='Z') Send(1);
		else Send(0);
	}
}


#include "Bruno.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=100010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
char S[MAXN];
int stk[MAXN], sz;
bool mark[MAXN];

inline void Rem(int x){
//	debug(x)
//	if (mark[x]) debug("fuck")
	Remove(x);
	mark[x]=1;
}

void Bruno(int n, int m, vector<int> A){
	int posx=0;
	for (int i=0; i<17; i++) posx|=(A[i]<<i);
	for (int i=0; i<posx; i++) Rem(i);
	for (int i=posx; i<n; i++){
		if (!A[i-posx+17]){
			stk[++sz]=i;
		}
		else{
			while (sz>1) Rem(stk[sz--]);
			Rem(i);
		}
	}
	while (sz) Rem(stk[sz--]);

	for (int i=0; i<n; i++) if (!mark[i]) Remove(i);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 484 KB Output is correct
2 Correct 1 ms 484 KB Output is correct
3 Correct 1 ms 484 KB Output is correct
4 Correct 0 ms 484 KB Output is correct
5 Correct 1 ms 484 KB Output is correct
6 Correct 1 ms 484 KB Output is correct
7 Correct 1 ms 480 KB Output is correct
8 Correct 1 ms 484 KB Output is correct
9 Correct 1 ms 484 KB Output is correct
10 Correct 0 ms 480 KB Output is correct
11 Correct 0 ms 484 KB Output is correct

Subtask #2
64.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 64 ms 7872 KB Partially correct
2 Partially correct 66 ms 7844 KB Partially correct
3 Partially correct 65 ms 7728 KB Partially correct
4 Partially correct 66 ms 7964 KB Partially correct
5 Partially correct 73 ms 7796 KB Partially correct
6 Partially correct 68 ms 7808 KB Partially correct
7 Partially correct 64 ms 7748 KB Partially correct
8 Partially correct 63 ms 7848 KB Partially correct
9 Partially correct 72 ms 7768 KB Partially correct
10 Partially correct 72 ms 7836 KB Partially correct
11 Partially correct 65 ms 7784 KB Partially correct
12 Partially correct 62 ms 7780 KB Partially correct
13 Partially correct 76 ms 8192 KB Partially correct
14 Partially correct 72 ms 7796 KB Partially correct
15 Partially correct 68 ms 7872 KB Partially correct
16 Partially correct 71 ms 7760 KB Partially correct
17 Partially correct 76 ms 8264 KB Partially correct
18 Correct 52 ms 6532 KB Output is correct
19 Correct 56 ms 6392 KB Output is correct
20 Partially correct 65 ms 7780 KB Partially correct
21 Partially correct 77 ms 7780 KB Partially correct
22 Partially correct 73 ms 8140 KB Partially correct
23 Partially correct 64 ms 7780 KB Partially correct
24 Partially correct 63 ms 7744 KB Partially correct
25 Correct 54 ms 6516 KB Output is correct
26 Partially correct 73 ms 8248 KB Partially correct
27 Correct 53 ms 6432 KB Output is correct
28 Partially correct 73 ms 8192 KB Partially correct
29 Correct 49 ms 6448 KB Output is correct
30 Correct 52 ms 6432 KB Output is correct
31 Correct 55 ms 6480 KB Output is correct
32 Partially correct 69 ms 7836 KB Partially correct
33 Partially correct 64 ms 7708 KB Partially correct