# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
431522 | 2021-06-17T12:41:40 Z | Hazem | Carnival Tickets (IOI20_tickets) | C++14 | 1 ms | 204 KB |
#include "tickets.h" #include <vector> #include <bits/stdc++.h> #define LL long long using namespace std; vector<LL>vec; vector<vector<int>>vec1; long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(); vec1 = x; for(int i=0;i<n;i++) vec.push_back(x[i][0]); sort(vec.begin(),vec.end()); LL ans = 0; for(int i=0;i<vec.size();i++) ans += abs(vec[i]-vec[vec.size()/2]); allocate_tickets(vec1); return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Ticket 0 of color 0 is played on invalid day 500507564 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Ticket 0 of color 0 is played on invalid day 78791011 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | There is multiple tickets of color 0 on day 1 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | There is no ticket of color 0 on day 0 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | There is no ticket of color 0 on day 0 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | There is no ticket of color 0 on day 0 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Ticket 0 of color 0 is played on invalid day 500507564 |
2 | Halted | 0 ms | 0 KB | - |