oj.uz

Submission #574969

# Submission time Handle Problem Language Result Execution time Memory
574969 2022-06-09T13:31:59 Z Arvin Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 70 ms 8844 KB 
#include "Anna.h"
#include <bits/stdc++.h>
	
using namespace std;
	
#define ll long long
	
namespace {
	
int variable_example = 0;
	const int maxN = 1e5 + 5;	
}
	
struct SegmentTree {
	int tree[2*maxN];
	int n;
	
	void reset(){
		fill(tree, tree+2*maxN, 1e9);
	}
	
	void build(int n, vector<int> &v){
		this->n = n;
		for(int x=0;x<n;x++){
			tree[n+x] = v[x];
		}
		for(int x=n-1;x>0;x--){
			tree[x] = min(tree[x<<1], tree[x<<1|1]);
		}
	}
	
	void update(int pos, int val){
		pos += n;
	
		tree[pos] = val;
		for(int x=pos;x>1;x>>=1){
			tree[x>>1] = min(tree[x], tree[x^1]);
		}
	}
	
	int query(int left, int right){ // [L, R)
		int ans = 1e9;
		for(left += n, right += n; left < right; left >>= 1, right >>= 1){
			if(left&1){
				ans = min(ans, tree[left++]);
			}
			if(right&1){
				ans = min(ans, tree[--right]);
			}
		}
		return ans;
	}
} tree;
	
void Anna(int N, std::vector<char> S) {
	// 1 as store this first X or any Z after first Xa
	// 0 otherwise
	
	vector<int> v;
	int pos = -2;
	bool fX = false;
	for(int x=0;x<N;x++){
		if(S[x] == 'Z'){
			if(fX && (x+1 == N || S[x+1] != 'Z')){
				v.push_back(1);
			} else {
				v.push_back(0);
			}
			// Send(fX);
		} else if(S[x] == 'Y'){ // XYXYZYZYZYZ (occurences of X are always first than Y)
			// Send(0);
			v.push_back(0);
		} else if(S[x] == 'X'){
			if(!fX){
				v.push_back(1);
				// Send(1);
				fX = true;
				pos = x;
			} else {
				v.push_back(0);
				// Send(0);
			}
		}
	}
	
	for(auto val : v){
		Send(val);
	}
	// Send(v[0]);
	// bool skip = false;
	// for(int x=0;x<N;x++){
	// 	if(skip){
	// 		skip = false;
	// 		continue;
	// 	}
	
	// 	if(v[x] == 0){
	// 		if(x+1 == N || v[x+1] == 1){
	// 			Send(0);
	// 			if(x+1 < N && v[x+1] == 1) Send(1);
	// 			else Send(0);
	// 		} else {
	// 			Send(1);
	// 			if(x+2 < N && v[x+2] == 1){
	// 				Send(1);
	// 			} else {
	// 				Send(0);
	// 			}
	// 			skip = true;
	// 		}
	// 	}
	// }
}
    #include "Bruno.h"
    #include <bits/stdc++.h>
     
    using namespace std;
     
    #define ll long long
     
    namespace {
     
    int variable_example = 0;
     
    int FunctionExample(int P) { return 1 - P; }
     
    }  // namespace
     
    void Bruno(int N, int L, std::vector<int> A) {
    //	for (int i = 0; i < L; i++) {
    //	variable_example += FunctionExample(A[i]);
    //	}
    	assert(L <= N);
     
    	vector<int> ans;
    	int pos = -1, lst = 0;
    	for(int x=0;x<L;x++){
    		if(A[x] == 1){
    			if(pos == -1){
    				pos = x;
    				lst = x+1;
    			} else {
    				for(int y=x-1;y>=lst;y--){
    					ans.push_back(y);
    				}
    				ans.push_back(x);
    				lst = x+1;
    			}
    		}
    	}
    	
    	for(int x=0;x<=pos;x++){
    		ans.push_back(x);
    	}
    	for(int x=lst;x<N;x++){
    		ans.push_back(x);
    	}
     
    	for(auto val : ans){
    		// cout << "- " << val << "\n";
    		Remove(val);
    	}
    }

Compilation message

Anna.cpp: In function 'void Anna(int, std::vector<char>)':
Anna.cpp:60:6: warning: variable 'pos' set but not used [-Wunused-but-set-variable]
   60 |  int pos = -2;
      |      ^~~
Anna.cpp: At global scope:
Anna.cpp:10:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
   10 | int variable_example = 0;
      |     ^~~~~~~~~~~~~~~~

Bruno.cpp:12:9: warning: 'int {anonymous}::FunctionExample(int)' defined but not used [-Wunused-function]
   12 |     int FunctionExample(int P) { return 1 - P; }
      |         ^~~~~~~~~~~~~~~
Bruno.cpp:10:9: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
   10 |     int variable_example = 0;
      |         ^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 516 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 1 ms 516 KB Output is correct
4 Correct 1 ms 524 KB Output is correct
5 Correct 1 ms 516 KB Output is correct
6 Correct 1 ms 516 KB Output is correct
7 Correct 1 ms 516 KB Output is correct
8 Correct 1 ms 524 KB Output is correct
9 Correct 1 ms 524 KB Output is correct
10 Correct 1 ms 528 KB Output is correct
11 Correct 0 ms 628 KB Output is correct

Subtask #2
65.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 52 ms 8748 KB Partially correct
2 Partially correct 54 ms 8748 KB Partially correct
3 Partially correct 53 ms 8740 KB Partially correct
4 Partially correct 49 ms 8724 KB Partially correct
5 Partially correct 56 ms 8804 KB Partially correct
6 Partially correct 53 ms 8748 KB Partially correct
7 Partially correct 51 ms 8640 KB Partially correct
8 Partially correct 54 ms 8688 KB Partially correct
9 Partially correct 58 ms 8752 KB Partially correct
10 Partially correct 61 ms 8748 KB Partially correct
11 Partially correct 52 ms 8740 KB Partially correct
12 Partially correct 54 ms 8752 KB Partially correct
13 Partially correct 57 ms 8768 KB Partially correct
14 Partially correct 60 ms 8840 KB Partially correct
15 Partially correct 54 ms 8816 KB Partially correct
16 Partially correct 64 ms 8720 KB Partially correct
17 Partially correct 61 ms 8816 KB Partially correct
18 Partially correct 57 ms 8664 KB Partially correct
19 Partially correct 56 ms 8756 KB Partially correct
20 Partially correct 56 ms 8740 KB Partially correct
21 Partially correct 53 ms 8764 KB Partially correct
22 Partially correct 63 ms 8760 KB Partially correct
23 Partially correct 52 ms 8780 KB Partially correct
24 Partially correct 52 ms 8756 KB Partially correct
25 Partially correct 57 ms 8828 KB Partially correct
26 Partially correct 70 ms 8736 KB Partially correct
27 Partially correct 62 ms 8700 KB Partially correct
28 Partially correct 57 ms 8772 KB Partially correct
29 Partially correct 64 ms 8824 KB Partially correct
30 Partially correct 61 ms 8656 KB Partially correct
31 Partially correct 60 ms 8844 KB Partially correct
32 Partially correct 56 ms 8740 KB Partially correct
33 Partially correct 56 ms 8768 KB Partially correct