oj.uz

답안 #496217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496217 2021-12-21T03:17:29 Z minhcool Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 64 ms 8484 KB 
#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif
 
 
 
 
 
 
namespace {
 
const int maxn = 1e5+5;
const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;
int variable_example = 0;
 
}
 
void Anna(int n, std::vector<char> S) {
    vector<int> ret(n);
    bool zed = 0;
    for (int i = n-1; i>=0; --i) {
        if (S[i] == 'Z' && !zed) {
            ret[i] = 1; zed = 1;
        }
        else if (S[i] == 'X' && zed && (i==0 || S[i-1] != 'X')) {
            ret[i] = 1;
        }
    }
    REP(i,n) {
        Send(ret[i]);
    }
}
 
 
 
 
#include<bits/stdc++.h>
#include "Bruno.h"
using namespace std;

//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

//const int N = 1e5 + 5;

//const int oo = 1e18 + 7, mod = 1e9 + 7;

void Bruno(int N, int L, vector<int> a){
	//cout << N << " " << L << "\n";
	vector<int> not_rev;
	int pos = -1;
	for(int i = N - 1; i >= 0; i--){
		if(a[i]){
			pos = i;
			break;
		}
	}
	if(pos == -1){
		for(int i = 0; i < N; i++) Remove(i);
		return;
	}
	int lst = pos;
	for(int i = pos - 1; i >= 0; i--){
		if(!i || a[i]){
			for(int j = i + 1; j < lst; j++) Remove(j);
			Remove(i);
			lst = i;
		}
		//Remove(i);
	}
	for(int i = pos; i < N; i++) Remove(i);
}

/*
void process(){

}

signed main(){
	ios_base::sync_with_stdio(0);
	process();
}*/

Compilation message

Anna.cpp:42:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
   42 | int variable_example = 0;
      |     ^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
65.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 49 ms 8056 KB Partially correct
2 Partially correct 52 ms 8372 KB Partially correct
3 Partially correct 49 ms 8328 KB Partially correct
4 Partially correct 54 ms 8336 KB Partially correct
5 Partially correct 54 ms 8444 KB Partially correct
6 Partially correct 53 ms 8344 KB Partially correct
7 Partially correct 49 ms 8460 KB Partially correct
8 Partially correct 51 ms 8360 KB Partially correct
9 Partially correct 63 ms 8388 KB Partially correct
10 Partially correct 58 ms 8364 KB Partially correct
11 Partially correct 52 ms 8324 KB Partially correct
12 Partially correct 53 ms 8472 KB Partially correct
13 Partially correct 61 ms 8460 KB Partially correct
14 Partially correct 62 ms 8344 KB Partially correct
15 Partially correct 55 ms 8368 KB Partially correct
16 Partially correct 53 ms 8484 KB Partially correct
17 Partially correct 59 ms 8460 KB Partially correct
18 Partially correct 57 ms 8436 KB Partially correct
19 Partially correct 56 ms 8332 KB Partially correct
20 Partially correct 61 ms 8308 KB Partially correct
21 Partially correct 51 ms 8444 KB Partially correct
22 Partially correct 59 ms 8332 KB Partially correct
23 Partially correct 53 ms 8336 KB Partially correct
24 Partially correct 52 ms 8364 KB Partially correct
25 Partially correct 57 ms 8268 KB Partially correct
26 Partially correct 59 ms 8400 KB Partially correct
27 Partially correct 63 ms 8452 KB Partially correct
28 Partially correct 64 ms 8404 KB Partially correct
29 Partially correct 61 ms 8356 KB Partially correct
30 Partially correct 57 ms 8484 KB Partially correct
31 Partially correct 60 ms 8444 KB Partially correct
32 Partially correct 48 ms 8288 KB Partially correct
33 Partially correct 52 ms 8312 KB Partially correct