# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
539238 | timreizin | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 140 ms | 26168 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 <deque>
#include <cassert>
using namespace std;
const short INF = 32767;
int main()
{
cin.tie(0)->sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<pair<int, int>> doges(m);
for (auto &[b, p] : doges) cin >> b >> p;
const short D = 180;
vector<vector<short>> dp(n, vector<short>(D, INF));
vector<vector<short>> canGet(n), starts(n);
for (auto &[b, p] : doges)
{
starts[b].push_back(p);
if (p >= D) for (int i = b % p; i < n; i += p) canGet[i].push_back(p);
}
for (int i = 0; i < n; ++i)
{
sort(canGet[i].begin(), canGet[i].end());
canGet[i].erase(unique(canGet[i].begin(), canGet[i].end()), canGet[i].end());
sort(starts[i].begin(), starts[i].end());
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... |