Submission #853149

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
853149	2023-09-23 13:32:36	aymanrs	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	977 ms	99920 KiB

skyscraper

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")
using namespace std;
void solve(){
    short n, m;
    cin >> n >> m;
    short b[m], p;
    vector<short> h[n], sm[n];
    const short s = 800;
    for(int i = 0;i < m;i++){
        cin >> b[i] >> p;
        if(p>=s) h[b[i]].push_back(p);
        else sm[b[i]].push_back(p);
    }
    int d[n][s];
    bitset<s> v[n];
    for(int i = 0;i < n;i++) for(int j = 0;j < s;j++) d[i][j] = INT_MAX, v[i][j] = false;
    d[b[0]][0] = 0;
    priority_queue<pair<int, pair<short, short>>,vector<pair<int, pair<short, short>>>, greater<pair<int, pair<short, short>>>> q;
    q.push({0, {b[0], 0}});
    while(!q.empty()){
        short wi = q.top().second.first;
        short po = q.top().second.second;
        if(v[wi][po]) {
            q.pop();
            continue;
        }
        if(wi == b[1]){
            cout << d[wi][po] << '\n';
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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