# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824942 | pedroslrey | Carnival Tickets (IOI20_tickets) | C++14 | 421 ms | 62272 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 <bits/stdc++.h>
#include "tickets.h"
using namespace std;
using lli = long long;
vector<vector<int>> calc(vector<stack<int>> plus, vector<stack<int>> minus, int m, int k) {
int n = plus.size();
vector<vector<int>> ans(n, vector<int>(m, -1));
for (int round = 0; round < k; ++round) {
int cntplus = 0, cntminus = 0;
auto add_plus = [&plus, &ans, &round, &cntplus](int i) {
ans[i][plus[i].top()] = round;
plus[i].pop();
++cntplus;
};
auto add_minus = [&minus, &ans, &round, &cntminus](int i) {
ans[i][minus[i].top()] = round;
minus[i].pop();
++cntminus;
};
for (int i = 0; i < n; ++i) {
if (plus[i].empty()) add_minus(i);
else if (minus[i].empty()) add_plus(i);
else if (cntplus > cntminus) add_minus(i);
else add_plus(i);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |