oj.uz

Submission #394383

# Submission time Handle Problem Language Result Execution time Memory
394383 2021-04-26T13:17:56 Z oolimry Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 772 ms 8640 KB 
#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int) x.size())
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x, y) cerr << #x << " is " << x << ", " << #y << " is " << y << endl;
typedef long long lint;
typedef pair<lint, lint> ii;

void Anna(int n, vector<char> s){
	bool hasX = false;
	bool hasY = false;
	for(int i = 0;i < n;i++){
		int res = 0;
		
		if(s[i] == 'X'){
			if(hasX) res = 0;
			else{
				res = 1;
				hasX = 1;
			}
		}
		else{
			if(hasX){
				if(s[i] == 'Y'){
					if(hasY) res = 0;
					else res = 1, hasY = true;
				}
				else{
					if(hasY) res = 1, hasY = false;
					else res = 0;
				}
			}
			else res = 0;
		}
		
		Send(res);
	}
}
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int) x.size())
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x, y) cerr << #x << " is " << x << ", " << #y << " is " << y << endl;
typedef long long lint;
typedef pair<lint, lint> ii;

void Bruno(int n, int L, vector<int> A) {
	for(int i = 0;i < n;i++){
		show(A[i]);
		if(A[i] == 0) Remove(i);
	}
	
	int X = -1;;
	for(int i = 0;i < n;i++){
		if(A[i] == 1){
			if(X != -1) Remove(i);
			else X = i;
		}
	}
	
	if(X != -1) Remove(X);
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 484 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Incorrect 2 ms 484 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #2
0 / 95.0

# Verdict Execution time Memory Grader output
1 Incorrect 772 ms 8640 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -