oj.uz

답안 #899061

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899061 2024-01-05T12:30:02 Z weajink Ancient Machine 2 (JOI23_ancient2) C++17
0 / 100
 36 ms 1632 KB 
#include "ancient2.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//Autor: Michał Szeliga
#ifdef LOCAL
#define debug(...) __VA_ARGS__;
#else
#define debug(...) {}
#endif
#define read(...) debug((void)!freopen(__VA_ARGS__,"r",stdin););

const int M = 1001;
bitset<M> akt[1000];
int ile = 0;
int gauss(bitset<M> x){
	int i;
	for (i = 0; i < M-1; i++){
		if (akt[i].none() && x[i]){
			akt[i] = x;
			ile++;
			return i;
		}	
		x ^= akt[i];
	}
	return -1;
}
bool policz(int x){
	bitset<1001> wy;
	wy[x] = 1;
	for (int i = 0; i < M-1; i++){
		if (wy[i]) wy ^= akt[i];
	}
	return wy[1000];
}
void stworz_automat(int c, int r){
	bitset<M> wy;
	for (int i = r; i < M-1; i += c) wy[i] = 1;
	int id = gauss(wy);
	if (id != -1){
		int m = 2*c;
		vector<int> A,B;
		for (int i = 0; i < c; i++){
			if ((i+1)%c == r){
				A.push_back(r);
				B.push_back(c+r);
			}else{
				A.push_back((i+1)%c);
				B.push_back((i+1)%c);
			}
		}
		for (int i = c; i < 2*c; i++){
			if ((i+1)%c == r){
				A.push_back(r);
				B.push_back(c+r);
			}else{
				A.push_back(c+(i+1)%c);
				B.push_back(c+(i+1)%c);
			}
		}
		akt[id][1000] = (Query(m,A,B) >= c);
	}
}
string Solve(int n){
	for (int c = 1; c < 1000; c++){
		for (int r = 0; r < c; r++){
			stworz_automat(c,r);
			if (ile == 1000) break;
		}
	} 
	string wy;
	for (int i = 0; i < n; i++){
		if (policz(i)) wy += '1';
		else wy += '0';
	}
	return wy;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 36 ms 1632 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -