oj.uz

답안 #683920

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
683920 2023-01-19T16:22:57 Z speedyArda Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 2908 KB 
#include "bits/stdc++.h"
 
using namespace std;
const int MAXN = 3e4+5;
 
vector< vector < pair<int, int> > > adj(MAXN);
vector< vector <  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].push_back(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;
        int max_road[n];
        for (int j = 0; j < n; j++) {
            max_road[j] = 0;
            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[currNode];
                if(val == 0 || val > cnt)
                {
                    //adj[v].erase({val, currNode});
                    max_road[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[currNode];
                if(val == 0 || val > cnt)
                {
                    //adj[v].erase({val, currNode});
                    max_road[currNode] = cnt;
                    //adj[v].insert({cnt, currNode});
                    
                }
                //if(curr == 4)
                    //cout << temp.first << "\n";
                cnt++;
                currNode -= temp;
            }

            
        }

        for(int to = 0; to < n; to++)
        {
            int len = max_road[to];
            if(len != 0)
            {
                if (dp[v] + len < dp[to]) {
                    dp[to] = dp[v] + len;
            }
            }
        }
        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:119:9: warning: 'goal' may be used uninitialized in this function [-Wmaybe-uninitialized]
  119 |     ans = dp[goal];
      |     ~~~~^~~~~~~~~~
skyscraper.cpp:37:15: warning: 'begin' may be used uninitialized in this function [-Wmaybe-uninitialized]
   37 |     dp[begin] = 0;
      |     ~~~~~~~~~~^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 2 ms 1748 KB Output is correct
12 Correct 2 ms 1748 KB Output is correct
13 Correct 2 ms 1748 KB Output is correct
14 Correct 2 ms 1748 KB Output is correct
15 Correct 2 ms 1748 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 3 ms 1748 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 1 ms 1748 KB Output is correct
20 Correct 17 ms 1748 KB Output is correct
21 Correct 1 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 10 ms 1756 KB Output is correct
24 Correct 13 ms 1792 KB Output is correct
25 Correct 14 ms 1748 KB Output is correct
26 Correct 17 ms 1748 KB Output is correct
27 Correct 15 ms 1748 KB Output is correct
28 Correct 16 ms 1748 KB Output is correct
29 Correct 20 ms 1748 KB Output is correct
30 Correct 13 ms 1756 KB Output is correct
31 Correct 15 ms 1744 KB Output is correct
32 Correct 13 ms 1748 KB Output is correct
33 Correct 16 ms 1748 KB Output is correct
34 Correct 19 ms 1748 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 2 ms 1620 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 2 ms 1748 KB Output is correct
13 Correct 2 ms 1748 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 3 ms 1748 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 1 ms 1748 KB Output is correct
20 Correct 22 ms 1748 KB Output is correct
21 Correct 2 ms 1756 KB Output is correct
22 Correct 1 ms 1752 KB Output is correct
23 Correct 10 ms 1748 KB Output is correct
24 Correct 15 ms 1764 KB Output is correct
25 Correct 16 ms 1748 KB Output is correct
26 Correct 19 ms 1800 KB Output is correct
27 Correct 16 ms 1748 KB Output is correct
28 Correct 14 ms 1848 KB Output is correct
29 Correct 13 ms 1764 KB Output is correct
30 Correct 13 ms 1756 KB Output is correct
31 Correct 17 ms 1748 KB Output is correct
32 Correct 16 ms 1748 KB Output is correct
33 Correct 15 ms 1748 KB Output is correct
34 Correct 15 ms 1748 KB Output is correct
35 Correct 13 ms 2144 KB Output is correct
36 Correct 6 ms 1816 KB Output is correct
37 Correct 18 ms 2024 KB Output is correct
38 Correct 22 ms 2260 KB Output is correct
39 Correct 20 ms 2144 KB Output is correct
40 Correct 22 ms 2260 KB Output is correct
41 Correct 22 ms 2132 KB Output is correct
42 Correct 80 ms 2212 KB Output is correct
43 Correct 58 ms 2132 KB Output is correct
44 Correct 62 ms 2132 KB Output is correct
45 Correct 19 ms 2072 KB Output is correct
46 Correct 19 ms 2068 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 2 ms 1620 KB Output is correct
7 Correct 2 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1620 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 2 ms 1748 KB Output is correct
13 Correct 2 ms 1748 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 3 ms 1748 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 1 ms 1748 KB Output is correct
20 Correct 17 ms 1748 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 9 ms 1748 KB Output is correct
24 Correct 12 ms 1748 KB Output is correct
25 Correct 16 ms 1820 KB Output is correct
26 Correct 16 ms 1748 KB Output is correct
27 Correct 15 ms 1748 KB Output is correct
28 Correct 15 ms 1748 KB Output is correct
29 Correct 14 ms 1760 KB Output is correct
30 Correct 13 ms 1748 KB Output is correct
31 Correct 17 ms 1748 KB Output is correct
32 Correct 14 ms 1748 KB Output is correct
33 Correct 14 ms 1748 KB Output is correct
34 Correct 14 ms 1796 KB Output is correct
35 Correct 13 ms 2132 KB Output is correct
36 Correct 6 ms 1748 KB Output is correct
37 Correct 19 ms 2004 KB Output is correct
38 Correct 20 ms 2132 KB Output is correct
39 Correct 22 ms 2152 KB Output is correct
40 Correct 20 ms 2240 KB Output is correct
41 Correct 20 ms 2132 KB Output is correct
42 Correct 60 ms 2132 KB Output is correct
43 Correct 62 ms 2132 KB Output is correct
44 Correct 60 ms 2196 KB Output is correct
45 Correct 19 ms 2132 KB Output is correct
46 Correct 19 ms 2136 KB Output is correct
47 Correct 532 ms 2420 KB Output is correct
48 Correct 7 ms 2508 KB Output is correct
49 Correct 6 ms 2532 KB Output is correct
50 Correct 5 ms 2424 KB Output is correct
51 Execution timed out 1071 ms 2908 KB Time limit exceeded
52 Halted 0 ms 0 KB -