oj.uz

답안 #710492

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710492 2023-03-15T09:33:33 Z baojiaopisu Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 51 ms 8124 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) {
	int l = INF, r = 0;
	for(int i = 0; i < n; i++) {
		if(s[i] == 'X' && l > n) l = i;
		if(s[i] == 'Z') r = i;
	}	

	if(l > r) {
		Send(0);
		return;
	}

	vector<int> pos;
	for(int i = 0; i < n; i++) {
		if(i < r && s[i] == 'Y' && i > l && s[i - 1] != 'Y') {
			Send(1);
			// cerr << 1;
			pos.pb(i);
			++i;
		} else {
			if(i == l || i == r) {
				Send(1);
				// cerr << 1;
			}
			else {
				Send(0);
				// cerr << 0;
			}
		}
	}

	for(auto x : pos) {
		if(s[x - 1] == 'X') {
			Send(0);
			// cerr << 0;
		}
		else {
			Send(1);
			// cerr << 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];
int b[N];

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

void Bruno(int n, int c, vector<int> a) {
	if(c < n) {
		for(int i = 0; i < n; i++) Remove(i);
		return;
	}

	int cnt = 0, pos = -1;
	for(int i = 0; i < c; i++) {
		cnt += a[i];
		if(cnt >= 2 && n - i - 1 == (cnt - 2)) {
			assert(pos == -1);
			pos = i;
		}
	}

	for(int i = pos + 1; i < n; i++) {
		b[i - pos] = a[i];
	}

	int l = -1, r = 0; cnt = 0;
	for(int i = 0; i <= pos; i++) {
		if(a[i]) ++cnt;
		if(a[i] && l == -1) l = i;
		if(a[i]) r = i + cnt - 2;
	}

	cnt = 0;
	int last = l;
	for(int i = l + 1, pos = l + 1; i < r; i++, pos++) {
		if(a[i]) {
			++cnt;
			if(b[cnt]) {
				// cerr << debug(pos) << " " << debug(last) << endl; 
				int curr = pos - 2;
				while(curr > last) {
					Remove(curr);
					ok[curr] = true;
					--curr;					
				}
				Remove(pos - 1);
				ok[pos - 1] = true;
				last = pos - 1;
			}
			++pos;
		}
	}

	// cerr << pos << " " << l << " " << r << endl;
	int curr = r - 1;
	while(curr > last) {
		Remove(curr);
		ok[curr] = true;
		--curr;
	}
	Remove(r);
	ok[r] = true;
	for(int i = 0; i < n; i++) if(!ok[i]) Remove(i);
}

// 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 Correct 0 ms 508 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 0 ms 504 KB Output is correct
4 Incorrect 1 ms 508 KB Wrong Answer [6]
5 Halted 0 ms 0 KB -

Subtask #2
0 / 95.0

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