oj.uz

답안 #683917

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
683917 2023-01-19T16:17:00 Z speedyArda Jakarta Skyscrapers (APIO15_skyscraper) C++14
22 / 100
 1000 ms 185288 KB 
#include "bits/stdc++.h"
 
using namespace std;
const int MAXN = 3e4+5;
 
vector< set< pair<int, int> > > adj(MAXN);
vector< set <  int > > doges(MAXN);
int dp[MAXN];
//map< pair<int, int>, bool > done;
map< pair<int, int>, int> max_road;
bool visited[MAXN];
int main() 
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    int goal, begin;
    for(int i = 0; i < m; i++)
    {
        pair<int, int> temp;
        cin >> temp.first >> temp.second;
        if(i == 1)
            goal = temp.first;
        else if(i == 0)
            begin = temp.first;
        doges[temp.first].insert(temp.second);
       
    }
 
    for(int i = 0; i <= n; i++) {
        dp[i] = 1e9;
        //visited[i] = false;
    }

    //visited[begin] = false;
    dp[begin] = 0;
    //set< pair<int, int> > curr; 
    //curr.insert({0, begin});
    int ans =  1e9;
    for(int i = 0; i < n; i++)
    {
        int v = -1;
        for (int j = 0; j < n; j++) {
            if (!visited[j] && (v == -1 || dp[j] < dp[v]))
                v = j;
        }

         if (dp[v] == 1e9)
            break;

        visited[v] = true;
        for(int temp : doges[v]) {
            int currNode = v + temp;
            int cnt = 1;
            while(currNode < n)
            {
                int val = max_road[{v, currNode}];
                if(val == 0 || val > cnt)
                {
                    adj[v].erase({val, currNode});
                    max_road[{v, currNode}] = cnt;
                    adj[v].insert({cnt, currNode});
                    
                }
                //if(curr == 4)
                    //cout << temp.first << "\n";
                cnt++;
                currNode += temp;
            }

            currNode = v - temp;
            cnt = 1;
            while(currNode >= 0)
            {
                int val = max_road[{v, currNode}];
                if(val == 0 || val > cnt)
                {
                    adj[v].erase({val, currNode});
                    max_road[{v, currNode}] = cnt;
                    adj[v].insert({cnt, currNode});
                    
                }
                //if(curr == 4)
                    //cout << temp.first << "\n";
                cnt++;
                currNode -= temp;
            }
        }
        for (auto edge : adj[v]) {
            int to = edge.second;
            int len = edge.first;

            if (dp[v] + len < dp[to]) {
                dp[to] = dp[v] + len;
            }
        }

        adj[v].clear();


    }
    
    ans = dp[goal];
    if(ans >= 1e9)
        ans = -1;
    cout << ans << "\n";
 
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:37:15: warning: 'begin' may be used uninitialized in this function [-Wmaybe-uninitialized]
   37 |     dp[begin] = 0;
      |     ~~~~~~~~~~^~~
skyscraper.cpp:104:9: warning: 'goal' may be used uninitialized in this function [-Wmaybe-uninitialized]
  104 |     ans = dp[goal];
      |     ~~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3156 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3156 KB Output is correct
4 Correct 2 ms 3156 KB Output is correct
5 Correct 2 ms 3156 KB Output is correct
6 Correct 1 ms 3028 KB Output is correct
7 Correct 2 ms 3156 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3156 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3156 KB Output is correct
8 Correct 1 ms 3156 KB Output is correct
9 Correct 2 ms 3124 KB Output is correct
10 Correct 3 ms 3156 KB Output is correct
11 Correct 5 ms 3540 KB Output is correct
12 Correct 2 ms 3156 KB Output is correct
13 Correct 5 ms 3668 KB Output is correct
14 Correct 4 ms 3284 KB Output is correct
15 Correct 4 ms 3284 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3156 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3156 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3156 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 3156 KB Output is correct
9 Correct 2 ms 3156 KB Output is correct
10 Correct 3 ms 3156 KB Output is correct
11 Correct 5 ms 3540 KB Output is correct
12 Correct 2 ms 3156 KB Output is correct
13 Correct 4 ms 3776 KB Output is correct
14 Correct 4 ms 3284 KB Output is correct
15 Correct 3 ms 3284 KB Output is correct
16 Correct 2 ms 3156 KB Output is correct
17 Correct 11 ms 4436 KB Output is correct
18 Correct 2 ms 3156 KB Output is correct
19 Correct 2 ms 3156 KB Output is correct
20 Execution timed out 1096 ms 180932 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3156 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 3156 KB Output is correct
9 Correct 2 ms 3148 KB Output is correct
10 Correct 2 ms 3156 KB Output is correct
11 Correct 4 ms 3540 KB Output is correct
12 Correct 3 ms 3156 KB Output is correct
13 Correct 5 ms 3668 KB Output is correct
14 Correct 4 ms 3284 KB Output is correct
15 Correct 4 ms 3284 KB Output is correct
16 Correct 2 ms 3172 KB Output is correct
17 Correct 11 ms 4488 KB Output is correct
18 Correct 2 ms 3156 KB Output is correct
19 Correct 2 ms 3156 KB Output is correct
20 Execution timed out 1093 ms 185288 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 3 ms 3028 KB Output is correct
3 Correct 2 ms 3156 KB Output is correct
4 Correct 2 ms 3156 KB Output is correct
5 Correct 2 ms 3156 KB Output is correct
6 Correct 2 ms 3156 KB Output is correct
7 Correct 2 ms 3156 KB Output is correct
8 Correct 2 ms 3156 KB Output is correct
9 Correct 2 ms 3156 KB Output is correct
10 Correct 2 ms 3156 KB Output is correct
11 Correct 5 ms 3504 KB Output is correct
12 Correct 2 ms 3156 KB Output is correct
13 Correct 5 ms 3668 KB Output is correct
14 Correct 4 ms 3284 KB Output is correct
15 Correct 3 ms 3284 KB Output is correct
16 Correct 2 ms 3156 KB Output is correct
17 Correct 12 ms 4436 KB Output is correct
18 Correct 2 ms 3156 KB Output is correct
19 Correct 2 ms 3156 KB Output is correct
20 Execution timed out 1096 ms 174528 KB Time limit exceeded
21 Halted 0 ms 0 KB -