Submission #539033

#	Time	Username	Problem	Language	Result	Execution time	Memory
539033		timreizin	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	0 / 100	1 ms	300 KiB

skyscraper

#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>

using namespace std;

const int INF = 1e9;

int main()
{
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> doges(m);
    for (auto &[b, p] : doges) cin >> b >> p;
    const int D = 180;
    vector<vector<int>> dp(n, vector<int>(D, 1e9));
    vector<vector<int>> canGet(n);
    for (auto &[b, p] : doges) 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.begin(), canGet.end());
        canGet.erase(unique(canGet.begin(), canGet.end()), canGet.end());
        for (int j = 0; j < canGet.size(); ++j) dp[i].push_back(1e9);
    }
    
    return 0;
}

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:24:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for (int j = 0; j < canGet.size(); ++j) dp[i].push_back(1e9);
      |                         ~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43