oj.uz

답안 #496218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496218 2021-12-21T03:18:58 Z minhcool Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 62 ms 8228 KB 
#include "Anna.h"
#include<bits/stdc++.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 oo = 1e18 + 7, mod = 1e9 + 7;
 
int ret[100005];
 
void Anna(int n, vector<char> S){
	int need = 0, occ = 0;
	for(int i = n - 1; i >= 0; i--){
		if(S[i] == 'Z' && !occ){
			occ = 1;
			ret[i] = 1;
		}
		else if(S[i] == 'X' && occ && (!i || S[i - 1] != 'X')){
			ret[i] = 1;
		}
	}
	for(int i = 0; i < n; i++) Send(ret[i]);
}
/*
void process(){
 
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	process();
}*/
#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: In function 'void Anna(int, std::vector<char>)':
Anna.cpp:22:6: warning: unused variable 'need' [-Wunused-variable]
   22 |  int need = 0, occ = 0;
      |      ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
65.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 51 ms 8044 KB Partially correct
2 Partially correct 56 ms 8020 KB Partially correct
3 Partially correct 52 ms 8028 KB Partially correct
4 Partially correct 51 ms 8068 KB Partially correct
5 Partially correct 51 ms 8168 KB Partially correct
6 Partially correct 62 ms 8164 KB Partially correct
7 Partially correct 54 ms 8228 KB Partially correct
8 Partially correct 50 ms 8136 KB Partially correct
9 Partially correct 51 ms 8020 KB Partially correct
10 Partially correct 54 ms 8084 KB Partially correct
11 Partially correct 52 ms 8140 KB Partially correct
12 Partially correct 52 ms 8164 KB Partially correct
13 Partially correct 59 ms 8156 KB Partially correct
14 Partially correct 59 ms 7768 KB Partially correct
15 Partially correct 53 ms 8128 KB Partially correct
16 Partially correct 54 ms 8200 KB Partially correct
17 Partially correct 60 ms 7700 KB Partially correct
18 Partially correct 62 ms 7708 KB Partially correct
19 Partially correct 60 ms 7712 KB Partially correct
20 Partially correct 51 ms 8036 KB Partially correct
21 Partially correct 51 ms 8140 KB Partially correct
22 Partially correct 59 ms 7680 KB Partially correct
23 Partially correct 51 ms 8140 KB Partially correct
24 Partially correct 51 ms 8032 KB Partially correct
25 Partially correct 59 ms 7768 KB Partially correct
26 Partially correct 60 ms 7656 KB Partially correct
27 Partially correct 60 ms 7652 KB Partially correct
28 Partially correct 61 ms 7724 KB Partially correct
29 Partially correct 60 ms 7680 KB Partially correct
30 Partially correct 62 ms 7624 KB Partially correct
31 Partially correct 57 ms 7764 KB Partially correct
32 Partially correct 53 ms 8164 KB Partially correct
33 Partially correct 52 ms 8128 KB Partially correct