oj.uz

답안 #710408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710408 2023-03-15T08:27:22 Z baojiaopisu Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 51 ms 7316 KB 
#include "Anna.h"
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

// void Send(int x) {
// 	cout << x << " ";
// }

void Anna(int n, vector<char> s) {
	for(auto x : s) {
		if(x == 'X') {
			Send(0);
			Send(0);
		}

		if(x == 'Y') {
			Send(0);
			Send(1);
		}

		if(x == 'Z') {
			Send(1);
		}
	}
};

// void BaoJiaoPisu() {
// 	int n; cin >> n;
// 	vector<char> s(n);
// 	for(auto &x : s) cin >> x;
// 	Anna(n, s);	
// }

// int main()
// {
//     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//     #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
//     #else 
//     //online
//     #endif

//     int tc = 1, ddd = 0;
//     // cin >> tc;
//     while(tc--) {
//         //ddd++;
//         //cout << "Case #" << ddd << ": ";
//         BaoJiaoPisu();
//     }
// }
#include "Bruno.h"
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

bool ok[N];

// void Remove(int x) {
// 	cout << x << endl;
// };

void Bruno(int n, int c, vector<int> a) {
	string s = "";
	for(int i = 0; i < c; i++) {
		if(a[i] == 0) {
			if(a[i + 1] == 0) s += 'X';
			else s += 'Y';
			i++;
		} else {
			s += 'Z';
		}
	}

	int curr = 0;
	vector<int> q;
	int pos = -1;
	for(int i = 0; i < n; i++) {
		if(s[i] == 'Z') pos = i;
		if(s[i] == 'X' && curr == 0) {
			q.pb(i);
			curr ^= 1;
		}

		if(s[i] == 'Y' && curr == 1) {
			q.pb(i);
			curr ^= 1;
		}
	}

	while(q.size() && q.back() > pos) q.pop_back();
	while(q.size() & 1) q.pop_back();
	for(auto x : q) ok[x] = true;
	if(pos >= 0) ok[pos] = true;
	for(int i = 0; i < n; i++) {
		if(!ok[i]) Remove(i);
	}

	for(int i = q.size() - 1; i >= 0; i--) {
		Remove(i);
	}

	if(pos >= 0) Remove(pos);
}

// void BaoJiaoPisu() {
// 	int n, l; 
// 	cin >> n >> l;
// 	vector<int> a(l);
// 	for(auto &x : a) cin >> x;
// 	Bruno(n, l, a);
// }

// int main()
// {
//     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//     #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
//     #else 
//     //online
//     #endif

//     int tc = 1, ddd = 0;
//     // cin >> tc;
//     while(tc--) {
//         //ddd++;
//         //cout << "Case #" << ddd << ": ";
//         BaoJiaoPisu();
//     }
// }

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 508 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 7316 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -