# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292479 | shrek12357 | Go (COCI18_go) | C++14 | 1 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
using namespace std;
struct p {
int a;
int b;
int t;
};
int main() {
int n, m, z;
cin >> n >> m >> z;
vector<p> pokeL, pokeR;
pokeL.push_back({ m, 0, 2005 });
pokeR.push_back({ m, 0, 2005 });
for (int i = 0; i < z; i++) {
int a, b, c;
cin >> a >> b >> c;
if (a <= m) {
pokeL.push_back({ a, b, c });
}
else {
pokeR.push_back({ a, b, c });
}
}
int best = 0;
for (int i = 0; i < pokeR.size(); i++) {
for (int j = 0; j < pokeL.size(); j++) {
bool ok = false;
int time = 2 * (m - pokeL[j].a);
int cur = 0;
for (int k = 0; k <= j; k++) {
if (m - pokeL[k].a < pokeL[k].t) {
cur += pokeL[k].b;
}
}
for (int k = 0; k <= i; k++) {
if (pokeR[k].a - m + time < pokeR[k].t) {
cur += pokeR[k].b;
if (k == i) {
ok = true;
}
}
}
if (ok) {
best = max(best, cur);
}
}
}
for (int i = 0; i < pokeL.size(); i++) {
for (int j = 0; j < pokeR.size(); j++) {
bool ok = false;
int time = 2 * (pokeR[j].a - m);
int cur = 0;
for (int k = 0; k <= j; k++) {
if (pokeR[k].a - m < pokeR[k].t) {
cur += pokeR[k].b;
}
}
for (int k = 0; k <= i; k++) {
if (m - pokeL[k].a + time < pokeL[k].t) {
cur += pokeL[k].b;
if (k == i) {
ok = true;
}
}
}
if (ok) {
best = max(best, cur);
}
}
}
cout << best << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |