oj.uz

답안 #419515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419515 2021-06-07T08:15:21 Z alishahali1382 Ancient Machine (JOI21_ancient_machine) C++17
90 / 100
 86 ms 8856 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);
	vector<int> vec;
	for (int i=posx; i<n; i++){
		if (S[i]=='Z'){
			if (i+1<n && S[i+1]=='Z') vec.pb(0);
			else vec.pb(1);
		}
		else vec.pb(0);
	}
	while (vec.size()%4) vec.pb(0);
	string out="";
	for (int i=0; i<vec.size();){
		string S="";
		S+='0'+vec[i++];
		S+='0'+vec[i++];
		S+='0'+vec[i++];
		S+='0'+vec[i++];
		if (S=="0000") out+="000";
		if (S=="0001") out+="001";
		if (S=="0010") out+="010";
		if (S=="0100") out+="011";
		if (S=="1000") out+="100";
		if (S=="1010") out+="101";
		if (S=="1001") out+="110";
		if (S=="0101") out+="111";
	}
	for (char ch:out) Send(ch-'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);
	
	string B="";
	for (int i=17; i<m; ){
		string S="";
		S+='0'+A[i++];
		S+='0'+A[i++];
		S+='0'+A[i++];
		if (S=="000") B+="0000";
		if (S=="001") B+="0001";
		if (S=="010") B+="0010";
		if (S=="011") B+="0100";
		if (S=="100") B+="1000";
		if (S=="101") B+="1010";
		if (S=="110") B+="1001";
		if (S=="111") B+="0101";
	}

	for (int i=posx; i<n; i++){
		if (B[i-posx]=='0'){
			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);
}

Compilation message

Anna.cpp: In function 'void Anna(int, std::vector<char>)':
Anna.cpp:46:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |  for (int i=0; i<vec.size();){
      |                ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 496 KB Output is correct
5 Correct 1 ms 484 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 484 KB Output is correct
8 Correct 0 ms 484 KB Output is correct
9 Correct 0 ms 492 KB Output is correct
10 Correct 0 ms 492 KB Output is correct
11 Correct 1 ms 484 KB Output is correct

Subtask #2
85.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 77 ms 8420 KB Partially correct
2 Partially correct 75 ms 8308 KB Partially correct
3 Partially correct 69 ms 8316 KB Partially correct
4 Partially correct 66 ms 8348 KB Partially correct
5 Partially correct 69 ms 8272 KB Partially correct
6 Partially correct 71 ms 8352 KB Partially correct
7 Partially correct 66 ms 8240 KB Partially correct
8 Partially correct 76 ms 8372 KB Partially correct
9 Partially correct 74 ms 8320 KB Partially correct
10 Partially correct 73 ms 8312 KB Partially correct
11 Partially correct 68 ms 8236 KB Partially correct
12 Partially correct 68 ms 8288 KB Partially correct
13 Partially correct 86 ms 8756 KB Partially correct
14 Partially correct 74 ms 8388 KB Partially correct
15 Partially correct 69 ms 8324 KB Partially correct
16 Partially correct 73 ms 8332 KB Partially correct
17 Partially correct 74 ms 8688 KB Partially correct
18 Correct 61 ms 6364 KB Output is correct
19 Correct 55 ms 6500 KB Output is correct
20 Partially correct 66 ms 8252 KB Partially correct
21 Partially correct 67 ms 8320 KB Partially correct
22 Partially correct 75 ms 8776 KB Partially correct
23 Partially correct 78 ms 8332 KB Partially correct
24 Partially correct 67 ms 8392 KB Partially correct
25 Correct 52 ms 6464 KB Output is correct
26 Partially correct 77 ms 8856 KB Partially correct
27 Correct 51 ms 6352 KB Output is correct
28 Partially correct 76 ms 8752 KB Partially correct
29 Correct 62 ms 6528 KB Output is correct
30 Correct 53 ms 6432 KB Output is correct
31 Correct 53 ms 6496 KB Output is correct
32 Partially correct 68 ms 8420 KB Partially correct
33 Partially correct 78 ms 8312 KB Partially correct