oj.uz

Submission #365402

# Submission time Handle Problem Language Result Execution time Memory
365402 2021-02-11T15:33:57 Z kostia244 popa (BOI18_popa) C++17
0 / 100
 13 ms 492 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#ifdef EVAL
#include"popa.h"
#endif
#include<bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
 
namespace local {
	int ar[10010], qc = 0;
	int query(int a, int b, int c, int d) {
		qc++;
		int x = 0, y = 0;
		for(;a<=b;a++) x = __gcd(x, ar[a]);
		for(;c<=d;c++) y = __gcd(y, ar[c]);
		return x==y;
	}
};
#ifndef EVAL
using namespace local;
#endif
 
int solve(int n, int *L, int *R) {
	vector<int> st;
	int rt = -1;
	vector<int> start(n);
	for(int i = 0; i < n; i++) L[i] = R[i] = -1;
	for(int i = 0; i < n; i++) {
		while(st.size() && !query(start[st.back()], i, st.back(), st.back())) st.pop_back();
		if(st.empty()) {
			if(rt != -1) L[i] = rt;
			rt = i;
			start[i] = 0;
		} else {
			R[st.back()] = i;
			start[i] = i;
			st.pop_back();
		}
		//for(auto i : st) cout << i << " "; cout << endl;
		st.push_back(i);
	}
	return rt;
}
 
#ifndef EVAL
int main() {
	cin.tie(0)->sync_with_stdio(0);
	//multitest([&](){});
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> ar[i];
	vector<int> L(n), R(n);
	cout << solve(n, L.data(), R.data()) << endl;
	for(int i = 0; i < n; i++) cout << L[i] << " " << R[i] << '\n';
	cout << " :: " << qc << endl;
}
#endif

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 492 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 488 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 488 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -