Submission #1011230

#TimeUsernameProblemLanguageResultExecution timeMemory
1011230MilosMilutinovicMP3 Player (CEOI10_mp3player)C++14
20 / 100
1086 ms2896 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m, trg; cin >> n >> m >> trg; vector<char> op(n); vector<int> val(n); for (int i = 0; i < n; i++) { cin >> op[i] >> val[i]; } const int inf = (int) 2.000001e9; vector<int> qt(1, -1); qt.push_back(val[0]); qt.push_back(inf); for (int i = 1; i < n; i++) { qt.push_back(val[i] - val[i - 1]); } vector<int> new_qt; for (int t : qt) { new_qt.push_back(t); new_qt.push_back(t - 1); } qt = new_qt; sort(qt.rbegin(), qt.rend()); for (int t : qt) { for (int v1 = m; v1 >= 0; v1--) { int v2 = v1; for (int i = 1; i < n; i++) { int d = val[i] - val[i - 1]; if (d <= t) { if (op[i] == '+') { v2 = min(v2 + 1, m); } else { v2 = max(v2 - 1, 0); } } } if (v2 == trg) { if (t == inf) { cout << "infinity" << '\n'; } else { cout << t << " " << v1 << '\n'; } return 0; } } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...