oj.uz

답안 #419486

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419486 2021-06-07T07:43:04 Z alishahali1382 Ancient Machine (JOI21_ancient_machine) C++17
40 / 100
 101 ms 9988 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){
	vector<int> vec;
	for (int i=0; i<n; i++) vec.pb(S[i]-'X');
	while (vec.size()%5) vec.pb(0);
	for (int i=0; i<vec.size(); i+=5){
		int x=0;
		for (int j=i; j<i+5; j++) x=x*3+vec[j];
		for (int j=0; j<8; j++) Send((x>>j)&1);
	}
}


#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){
	vector<int> vec;
	for (int i=0; i<m; i+=8){
		int x=0;
		for (int j=0; j<8; j++) x+=(A[i+j]<<j);
		vector<int> shit;
		for (int j=0; j<5; j++) shit.pb(x%3), x/=3;
		for (int j=4; ~j; j--) vec.pb(shit[j]);
	}
	for (int i=0; i<n; i++) S[i]='X'+vec[i];
	
	for (int i=0; i<n; i++){
		if (S[i]=='X') stk[++sz]=i;
		if (S[i]=='Y'){
			if (!sz) Rem(i);
			else stk[++sz]=i;
		}
		if (S[i]=='Z'){
			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:32:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for (int i=0; i<vec.size(); i+=5){
      |                ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
35.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 83 ms 9416 KB Partially correct
2 Partially correct 82 ms 9564 KB Partially correct
3 Partially correct 84 ms 9508 KB Partially correct
4 Partially correct 81 ms 9416 KB Partially correct
5 Partially correct 82 ms 9544 KB Partially correct
6 Partially correct 80 ms 9420 KB Partially correct
7 Partially correct 82 ms 9552 KB Partially correct
8 Partially correct 82 ms 9548 KB Partially correct
9 Partially correct 82 ms 9488 KB Partially correct
10 Partially correct 80 ms 9564 KB Partially correct
11 Partially correct 80 ms 9420 KB Partially correct
12 Partially correct 94 ms 9420 KB Partially correct
13 Partially correct 88 ms 9988 KB Partially correct
14 Partially correct 90 ms 9524 KB Partially correct
15 Partially correct 91 ms 9600 KB Partially correct
16 Partially correct 91 ms 9472 KB Partially correct
17 Partially correct 86 ms 9944 KB Partially correct
18 Partially correct 90 ms 9616 KB Partially correct
19 Partially correct 101 ms 9524 KB Partially correct
20 Partially correct 80 ms 9416 KB Partially correct
21 Partially correct 79 ms 9420 KB Partially correct
22 Partially correct 91 ms 9900 KB Partially correct
23 Partially correct 89 ms 9588 KB Partially correct
24 Partially correct 81 ms 9628 KB Partially correct
25 Partially correct 90 ms 9536 KB Partially correct
26 Partially correct 88 ms 9868 KB Partially correct
27 Partially correct 89 ms 9540 KB Partially correct
28 Partially correct 89 ms 9876 KB Partially correct
29 Partially correct 88 ms 9476 KB Partially correct
30 Partially correct 90 ms 9496 KB Partially correct
31 Partially correct 91 ms 9476 KB Partially correct
32 Partially correct 81 ms 9536 KB Partially correct
33 Partially correct 82 ms 9404 KB Partially correct