Submission #89220

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
89220	2018-12-11T01:56:26 Z	jasony123123	Igra (COCI17_igra)	C++11	60 / 100	1000 ms	676 KB

igra

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
inline void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 R7 P3*************************/

int N;
string myStr, badStr;
int cnt[3];
bool seen[5001][5001];
bool dp[5001][5001]; // cnts for [a][b]

stack<char> ans;

bool solve(int idx) {
	if (idx == N) {
		ans.push('\n');
		return 1;
	}

	FOR(c, 0, 3) {
		if (cnt[c]>0 && badStr[idx] != c + 'a') {
			cnt[c]--;
			if (solve(idx + 1)) {
				ans.push((char)(c + 'a'));
				return 1;
			}
			cnt[c]++;
		}
	}
	return 0;
}

int main() {
	io();
	cin >> N;
	cin >> myStr >> badStr;
	FOR(i, 0, N)
		cnt[myStr[i] - 'a']++;
	solve(0);
	while (!ans.empty()) {
		cout << ans.top();
		ans.pop();
	}
	return 0;
}

Subtask #1

60.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	2 ms	504 KB	Output is correct
4	Correct	2 ms	504 KB	Output is correct
5	Correct	5 ms	504 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Execution timed out	1069 ms	504 KB	Time limit exceeded
8	Execution timed out	1078 ms	504 KB	Time limit exceeded
9	Execution timed out	1073 ms	664 KB	Time limit exceeded
10	Execution timed out	1070 ms	676 KB	Time limit exceeded