979B - Treasure Hunt - CodeForces Solution


greedy *1800

Please click on ads to support us..

C++ Code:

#include "bits/stdc++.h"
#include <iostream>
using namespace std;

int main() {
    int t,mx=0;
    char mxC;
    cin >>t;
    string s;
    int arr[3];
    map<char,int>mp;
    for(int i=0;i<3;i++){
        mp.clear();
        mx=0;
        cin >>s;
        for(auto x:s){
            mp[x]++;
        }
        for(auto &x:mp){
            mx= max(x.second,mx);
        }
        if(mx+t>s.length()){
            arr[i]=s.length();
            if (t==1)
                arr[i]--;
        }
        else
            arr[i]=mx+t;
    }
    if(arr[0]>arr[1] && arr[0]>arr[2])
        cout<<"Kuro";
    else if(arr[1]>arr[0] && arr[1]>arr[2])
        cout<<"Shiro";
    else if(arr[2]>arr[1] && arr[2]>arr[0])
        cout<<"Katie";
    else if(arr[0]==arr[1] || arr[0]==arr[2] || arr[1]==arr[2])
        cout<<"Draw";
}


Comments

Submit
0 Comments
More Questions

1363A - Odd Selection
131B - Opposites Attract
490C - Hacking Cypher
158B - Taxi
41C - Email address
1373D - Maximum Sum on Even Positions
1574C - Slay the Dragon
621A - Wet Shark and Odd and Even
1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array
224A - Parallelepiped
964A - Splits
1615A - Closing The Gap
4C - Registration System