oj.uz

답안 #710382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710382 2023-03-15T07:57:39 Z baojiaopisu Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 72 ms 8748 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__) << "] "
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};
 
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 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);
		}
	}
};
#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__) << "] "
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};
 
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 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';
		}
	}
  
  	assert(s.size() == n);
 
	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) {
		for(int i = 0; i < n; i++) Remove(i);
		return;
	}
 
	for(int i = l + 1; i < r; i++) {
		if(s[i] != 'Y') {
			Remove(i);
			ok[i] = true;
		}
	}
 
	for(int i = l + 1; i < r; i++) {
		if(s[i] == 'Y') {
			Remove(i);
			ok[i] = true;
		}
	}
 
	for(int i = 0; i < n; i++) {
		if(!ok[i]) Remove(i);
	}
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from Bruno.cpp:2:
Bruno.cpp: In function 'void Bruno(int, int, std::vector<int>)':
Bruno.cpp:87:20: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   87 |    assert(s.size() == n);
      |           ~~~~~~~~~^~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 95.0

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