oj.uz

Submission #518909

# Submission time Handle Problem Language Result Execution time Memory
518909 2022-01-25T06:06:48 Z Keshi Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 70 ms 13972 KB 
#include "Anna.h"
#include <vector>
 
namespace {
 
int variable_example = 0;
 
}
 
void Anna(int N, std::vector<char> S) {
	variable_example++;
	char x = 'X';
	for(int i = 0; i < N; i++){
		if(S[i] == x){
			Send(1);
			if(x == 'X') x = 'Y';
			else if(x == 'Y') x = 'Z';
			else x = 'Y';
		}
		else Send(0);
	}
	return;
}
//In the name of God
#include <bits/stdc++.h>
using namespace std;
#include "Bruno.h"
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int maxn = 2e5 + 100;
const int mod = 1e9 + 7;
const int inf = 1e9;
 
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r+", stdin);freopen("output.txt", "w+", stdout);
#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) ll((x).size())
#define all(x) (x).begin(), (x).end()
 
ll pw(ll a, ll b){
	ll c = 1;
	while(b){
		if(b & 1) c = c * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return c;
}
 
void Bruno(int N, int L, vector<int> A){
	assert(N == L);
	assert(L == Sz(A));
	vector<int> vec;
	for(int i = 0; i < N; i++){
		if(A[i]) vec.pb(i);
	}
	for(int i = N; i--;){
		if(!A[i]) Remove(i);
	}
	for(int i = 1; i < Sz(vec); i++){
		Remove(vec[i]);
	}
	Remove(vec[0]);
	return;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 484 KB Output is correct
2 Correct 0 ms 488 KB Output is correct
3 Correct 0 ms 496 KB Output is correct
4 Correct 0 ms 492 KB Output is correct
5 Correct 0 ms 484 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 488 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 496 KB Output is correct
10 Runtime error 1 ms 708 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #2
0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 69 ms 7572 KB Partially correct
2 Partially correct 56 ms 8068 KB Partially correct
3 Partially correct 54 ms 8076 KB Partially correct
4 Partially correct 70 ms 8092 KB Partially correct
5 Partially correct 55 ms 8028 KB Partially correct
6 Partially correct 60 ms 8196 KB Partially correct
7 Partially correct 60 ms 8072 KB Partially correct
8 Partially correct 54 ms 7976 KB Partially correct
9 Partially correct 54 ms 8112 KB Partially correct
10 Partially correct 65 ms 8080 KB Partially correct
11 Partially correct 54 ms 7988 KB Partially correct
12 Partially correct 55 ms 8032 KB Partially correct
13 Partially correct 61 ms 8036 KB Partially correct
14 Partially correct 53 ms 8288 KB Partially correct
15 Partially correct 50 ms 8108 KB Partially correct
16 Partially correct 52 ms 8124 KB Partially correct
17 Partially correct 66 ms 8004 KB Partially correct
18 Runtime error 52 ms 13972 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -