| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 45045 |
2018-04-11T05:07:57 Z |
Xellos |
Igra (COCI17_igra) |
C++14 |
|
2 ms |
664 KB |
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge
#ifdef DONLINE_JUDGE
// palindromic tree is better than splay tree!
#define lld I64d
#endif
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
int N;
string S,s;
cin >> N >> s >> S;
int cnt[] ={0,0,0}, cntS[] ={0,0,0};
for(int i =0; i < N; i++) cnt[s[i]-'a']++;
for(int i =0; i < N; i++) cntS[S[i]-'a']++;
for(int i =0; i < N; i++) for(int j =0; j < 3; j++) if(j != S[i]-'a') {
cnt[j]--;
cntS[S[i]-'a']--;
if(max(0,max(cntS[0]-cnt[2],cnt[1]-cntS[2])) > min(cnt[1],min(cntS[0],cnt[0]+cnt[1]-cntS[2]))) {
cnt[j]++;
cntS[S[i]-'a']++;
continue;}
s[i] ='a'+j;
break;}
cout << s << "\n";
}
// look at my code
// my code is amazing
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
Output is correct |
| 2 |
Correct |
2 ms |
464 KB |
Output is correct |
| 3 |
Correct |
2 ms |
464 KB |
Output is correct |
| 4 |
Correct |
2 ms |
464 KB |
Output is correct |
| 5 |
Correct |
2 ms |
484 KB |
Output is correct |
| 6 |
Correct |
2 ms |
484 KB |
Output is correct |
| 7 |
Correct |
2 ms |
600 KB |
Output is correct |
| 8 |
Correct |
2 ms |
600 KB |
Output is correct |
| 9 |
Correct |
2 ms |
656 KB |
Output is correct |
| 10 |
Correct |
2 ms |
664 KB |
Output is correct |
