Submission #232371

#	Time	Username	Problem	Language	Result	Execution time	Memory
232371		amoo_safar	Trapezi (COI17_trapezi)	C++14	6 / 100	5 ms	640 KiB

trapezi

#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;

const ll Mod = 1000000007LL;
const int N = 2e5 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;

char a[N];
int b[N];
int ans[N];
char F(int x){
	if(ans[x]) return '1';
	return '.';
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n;
	cin >> n;
	assert(n == 1);
	cin >> a[0] >> a[1] >> a[2] >> a[5] >> a[4] >> a[3];
	ll s = 0;
	for(int i = 0; i < 6; i++){
		b[i] = (a[i] == '0');
		s += b[i];
	}
	//debug(s);
	if(s == 6) return cout << "111\n222\n", 0;
	if(s != 3) return cout << "nemoguce\n", 0;
	ll fl = 0;
	for(int i = 0; i < 6; i++){
		ll t = b[i] + b[(i+1)%6] + b[(i + 2)%6];
		if(t == 3){
			for(int j = 0; j < 3; j++) ans[(i+j)%6] = 1;
			fl = 1;
			break;
		}
	}
	if(!fl) return cout << "nemoguce\n", 0;
	else cout << F(0) << F(1) << F(2) << '\n' << F(5) << F(4) << F(3) << '\n';
	return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 17
• Subtask 3: 0 / 18
• Subtask 4: 0 / 22
• Subtask 5: 0 / 37