Submission #476161

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
476161	2021-09-25T07:15:05 Z	LptN21	Igra (COCI17_igra)	C++14	100 / 100	2 ms	204 KB

igra

#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define PI acos(-1.0)
#define FF first
#define SS second
#define eps 1e-9
// vector
#define pb push_back
#define sz(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define lb lower_bound
#define ub upper_bound
// bit
#define CNTBIT(x) __builtin_popcount(x)
#define ODDBIT(x) __builtin_parity(x)
#define MASK(i) (1ll<<(i))
#define BIT(x, i) (((x)>>(i))&1)
#define SUBSET(big, small) (((big)&(small))==(small))
#define MINBIT(x) (x)&(-x)
// typedef
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef pair<int, ii> i3;
/* CODE BELOW */
const int N=5000+7, M=18;
const int MOD=1e9+7;
const ll oo=1e15+9;

int n, m, k, t;

char chA[N], chB[N];
int cntA[3], cntB[3];
int cntpA[3], cntpB[3];

void renew() {
    for(int i=0;i<3;i++) {
        cntA[i]=cntpA[i];
        cntB[i]=cntpB[i];
    }
}

bool check() {
    int lim=min(cntpB[0], cntpA[1]);
    for(int i=0;i<=lim;i++) {
        renew(), cntB[0]-=i, cntA[1]-=i;
        if(cntB[0]>cntA[2]) continue;
        if(cntA[1]>cntB[2]) continue;
        if(cntA[0]+cntA[1]<cntB[2]) continue;
        return 1;
    }
    return 0;
}

void solve(int idx) {
    if(idx==n) return;
    cntpB[chB[idx]-'a']--;
    for(int i=0;i<3;i++) {
        if(!cntpA[i]||i==chB[idx]-'a') continue;
        cntpA[i]--;
        if(check()) {
            printf("%c", char(i+'a'));
            solve(idx+1); return;
        }
        cntpA[i]++;
    }
}

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    //fastIO;
    scanf("%d\n%s\n%s", &n, &chA, &chB);
    for(int i=0;i<n;i++) {
        cntpA[chA[i]-'a']++;
        cntpB[chB[i]-'a']++;
    }
    solve(0);
    return 0;
}
/* stuff you should look for
    - int overflow, array bounds
    - special/edge cases (n=1?)
    - do smth instead of nothing and stay organized
    - WRITE STUFF DOWN
    - DONT JUST STICK ON ONE APPROACH
*/

Compilation message

igra.cpp: In function 'int main()':
igra.cpp:75:17: warning: format '%s' expects argument of type 'char*', but argument 3 has type 'char (*)[5007]' [-Wformat=]
   75 |     scanf("%d\n%s\n%s", &n, &chA, &chB);
      |                ~^           ~~~~
      |                 |           |
      |                 char*       char (*)[5007]
igra.cpp:75:21: warning: format '%s' expects argument of type 'char*', but argument 4 has type 'char (*)[5007]' [-Wformat=]
   75 |     scanf("%d\n%s\n%s", &n, &chA, &chB);
      |                    ~^             ~~~~
      |                     |             |
      |                     char*         char (*)[5007]
igra.cpp:75:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |     scanf("%d\n%s\n%s", &n, &chA, &chB);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	2 ms	204 KB	Output is correct
10	Correct	2 ms	204 KB	Output is correct