Submission #94139

#TimeUsernameProblemLanguageResultExecution timeMemory
94139KewoGo (COCI16_go)C++14
50 / 50
2 ms380 KiB
#include <bits/stdc++.h> #define pb push_back #define ppb pop_back #define fi first #define se second #define mid ((x + y) / 2) #define left (ind * 2) #define right (ind * 2 + 1) #define mp make_pair #define timer ((double)clock() / CLOCKS_PER_SEC) #define endl "\n" #define spc " " #define d1(x) cerr<<#x<<":"<<x<<endl #define d2(x, y) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<endl #define d3(x, y, z) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<" "<<#z<<":"<<z<<endl #define fast_io() ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0) using namespace std; typedef long long int lli; typedef pair<int, int> ii; typedef pair<ii, int> iii; typedef pair<double, double> dd; const int N = (int)(1e6 + 5); const int LOG = (int)(20); int n, maxi, tot; string ans; int f(int x, int y) { int ev = 0; while((y / x) != 0) { int tt = y; ev += tt / x; y -= (tt / x) * x; y += (tt / x) * 2; } return ev; } int main() { fast_io(); // freopen("inp.in", "r", stdin); cin >> n; for(int i = 1; i <= n; i++) { int a, b; string s; cin >> s; cin >> a >> b; int t = f(a, b); tot += t; if(maxi < t) { maxi = t; ans = s; } } cout << tot << endl << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...