Submission #920259

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
920259	2024-02-02T10:56:40 Z	Whisper	Go (COCI16_go)	C++17	34 / 50	1 ms	600 KB

go

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int N;

void Whisper(){
    cin >> N;
    string ans;
    int tot = 0, pre = 0;
    for (int i = 1; i <= N; ++i){
        string Name; int need, candy;
        cin >> Name >> need >> candy;
        need -= 2;
        tot += candy / need;
        if (candy / need > pre){
            ans = Name;
        }
        maximize(pre, candy / need);
    }
    cout << tot << "\n" << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1

34.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Partially correct	0 ms	344 KB	Partially correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Partially correct	1 ms	348 KB	Partially correct
13	Partially correct	0 ms	344 KB	Partially correct
14	Incorrect	1 ms	344 KB	Output isn't correct
15	Correct	1 ms	344 KB	Output is correct
16	Partially correct	0 ms	344 KB	Partially correct
17	Partially correct	1 ms	344 KB	Partially correct
18	Partially correct	0 ms	348 KB	Partially correct
19	Incorrect	0 ms	344 KB	Output isn't correct
20	Partially correct	1 ms	344 KB	Partially correct
21	Partially correct	0 ms	344 KB	Partially correct
22	Partially correct	1 ms	344 KB	Partially correct
23	Partially correct	1 ms	600 KB	Partially correct
24	Partially correct	0 ms	344 KB	Partially correct
25	Partially correct	1 ms	344 KB	Partially correct