답안 #45924 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
45924	2018-04-16T13:38:59 Z	TheDarkning	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1000 ms	3156 KB

skyscraper

/**
                  ▄█▀ ▀█▀ ▄▀▄ █▀ █▄█▄█ ▄▀▄ █▀ ▄█▀
                  <⇋⇋⇋⋛∰≓⊂(⌒,_ゝ⌒)⊃≓∰⋛⇋⇋⇋>

            ♔♕♖♗♘♙ ☜❷☞✪ ィℋ६ ≈ ᗫẵℜℵĬŊĞ ✪☜❷☞ ♚♛♜♝♞♟
            ♔♕♖♗♘♙                             ♚♛♜♝♞♟
                      ˙·٠•●♥ Ƹ̵̡Ӝ̵̨̄Ʒ ♥●•٠·˙

**/

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <time.h>
#include <map>
#include <deque>
#include <string>
#include <memory.h>
#include <queue>
#include <set>
#include <assert.h>

#define sz(s) s.size()
#define pb push_back
#define fr first
#define sc second
#define mk make_pair
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 3e4 + 5;
const int inf = 1e9 + 7;

int n, m, p, b, x, s, cnt;
vector < int > w[N];
priority_queue < pair < int, int > > q;

main()
{
   scanf("%d%d", &n, &m);

   for( int i = 1; i <= m; i++ )
   {
      scanf("%d%d", &p, &b);
      p++;

      if( i == 1 )
         s = p;
      if( i == 2 )
         x = p;

      w[ p ].pb( b );
   }
   vector < int > d( n + 3, inf );
   d[ s ] = 0;

   q.push( mk( d[s], s ) );

   while( !q.empty() )
   {
      int v = q.top().sc, cur = -q.top().fr;
      q.pop();

      if( cur > d[ v ] ) continue;

      if (v == x) {
         printf("%d", d[v]);
         return 0;
      }
      for( int l : w[v] )
      {
         int to = v;
         cnt = 0;

         while( to <= n )
         {
            cnt++;
            to = v + l * cnt;
            if( to > n )  break;
            if( d[ v ] + cnt < d[ to ] )
            {
               d[ to ] = d[ v ] + cnt;
               q.push( mk( -d[ to ], to ) );
            }
         }

         to = v;
         cnt = 0;

         while( to )
         {
            cnt++;
            to = v - l * cnt;
            if( to <= 0 ) break;
            if( d[ v ] + cnt < d[ to ] )
            {
               d[ to ] = d[ v ] + cnt;
               q.push( mk( -d[ to ], to ) );
            }
         }
      }
   }
   if( d[ x ] == inf )
      d[ x ] = -1;
   printf("%d", d[x]);
}

Compilation message

skyscraper.cpp:41:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:43:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d", &n, &m);
    ~~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp:47:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d%d", &p, &b);
       ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1532 KB	Output is correct
2	Correct	3 ms	1532 KB	Output is correct
3	Correct	3 ms	1532 KB	Output is correct
4	Correct	3 ms	1532 KB	Output is correct
5	Correct	3 ms	1532 KB	Output is correct
6	Correct	2 ms	1532 KB	Output is correct
7	Correct	3 ms	1532 KB	Output is correct
8	Correct	2 ms	1532 KB	Output is correct
9	Correct	3 ms	1532 KB	Output is correct
10	Correct	3 ms	1532 KB	Output is correct
11	Correct	3 ms	1532 KB	Output is correct
12	Correct	3 ms	1532 KB	Output is correct
13	Correct	4 ms	1532 KB	Output is correct
14	Correct	4 ms	1532 KB	Output is correct
15	Correct	3 ms	1532 KB	Output is correct
16	Correct	3 ms	1532 KB	Output is correct
17	Correct	4 ms	1532 KB	Output is correct
18	Correct	3 ms	1532 KB	Output is correct
19	Correct	3 ms	1532 KB	Output is correct
20	Correct	19 ms	1532 KB	Output is correct
21	Correct	3 ms	1532 KB	Output is correct
22	Correct	3 ms	1532 KB	Output is correct
23	Correct	3 ms	1532 KB	Output is correct
24	Correct	3 ms	1532 KB	Output is correct
25	Correct	3 ms	1532 KB	Output is correct
26	Correct	3 ms	1532 KB	Output is correct
27	Correct	4 ms	1532 KB	Output is correct
28	Correct	3 ms	1532 KB	Output is correct
29	Correct	4 ms	1532 KB	Output is correct
30	Correct	3 ms	1532 KB	Output is correct
31	Correct	3 ms	1532 KB	Output is correct
32	Correct	4 ms	1532 KB	Output is correct
33	Correct	6 ms	1532 KB	Output is correct
34	Correct	5 ms	1532 KB	Output is correct
35	Correct	11 ms	1532 KB	Output is correct
36	Correct	5 ms	1532 KB	Output is correct
37	Correct	10 ms	1532 KB	Output is correct
38	Correct	15 ms	1660 KB	Output is correct
39	Correct	18 ms	1660 KB	Output is correct
40	Correct	18 ms	1660 KB	Output is correct
41	Correct	20 ms	1660 KB	Output is correct
42	Correct	14 ms	1660 KB	Output is correct
43	Correct	8 ms	1660 KB	Output is correct
44	Correct	236 ms	1660 KB	Output is correct
45	Correct	12 ms	1660 KB	Output is correct
46	Correct	12 ms	1660 KB	Output is correct

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	1660 KB	Output is correct
2	Correct	3 ms	1660 KB	Output is correct
3	Correct	2 ms	1660 KB	Output is correct
4	Correct	2 ms	1660 KB	Output is correct
5	Correct	3 ms	1660 KB	Output is correct
6	Correct	3 ms	1660 KB	Output is correct
7	Correct	2 ms	1660 KB	Output is correct
8	Correct	2 ms	1660 KB	Output is correct
9	Correct	2 ms	1660 KB	Output is correct
10	Correct	3 ms	1660 KB	Output is correct
11	Correct	3 ms	1660 KB	Output is correct
12	Correct	4 ms	1660 KB	Output is correct
13	Correct	3 ms	1660 KB	Output is correct
14	Correct	4 ms	1660 KB	Output is correct
15	Correct	4 ms	1660 KB	Output is correct
16	Correct	3 ms	1660 KB	Output is correct
17	Correct	4 ms	1660 KB	Output is correct
18	Correct	3 ms	1660 KB	Output is correct
19	Correct	3 ms	1660 KB	Output is correct
20	Correct	17 ms	1660 KB	Output is correct
21	Correct	3 ms	1660 KB	Output is correct
22	Correct	3 ms	1660 KB	Output is correct
23	Correct	4 ms	1660 KB	Output is correct
24	Correct	4 ms	1660 KB	Output is correct
25	Correct	3 ms	1660 KB	Output is correct
26	Correct	4 ms	1660 KB	Output is correct
27	Correct	3 ms	1660 KB	Output is correct
28	Correct	4 ms	1660 KB	Output is correct
29	Correct	4 ms	1660 KB	Output is correct
30	Correct	4 ms	1660 KB	Output is correct
31	Correct	3 ms	1660 KB	Output is correct
32	Correct	3 ms	1660 KB	Output is correct
33	Correct	5 ms	1660 KB	Output is correct
34	Correct	5 ms	1660 KB	Output is correct
35	Correct	10 ms	1660 KB	Output is correct
36	Correct	4 ms	1660 KB	Output is correct
37	Correct	14 ms	1660 KB	Output is correct
38	Correct	20 ms	1660 KB	Output is correct
39	Correct	18 ms	1660 KB	Output is correct
40	Correct	13 ms	1716 KB	Output is correct
41	Correct	15 ms	1716 KB	Output is correct
42	Correct	14 ms	1716 KB	Output is correct
43	Correct	10 ms	1716 KB	Output is correct
44	Correct	198 ms	1716 KB	Output is correct
45	Correct	16 ms	1716 KB	Output is correct
46	Correct	19 ms	1716 KB	Output is correct
47	Correct	15 ms	2284 KB	Output is correct
48	Correct	17 ms	2284 KB	Output is correct
49	Correct	18 ms	2284 KB	Output is correct
50	Correct	8 ms	2284 KB	Output is correct
51	Correct	34 ms	3156 KB	Output is correct
52	Correct	26 ms	3156 KB	Output is correct
53	Correct	16 ms	3156 KB	Output is correct
54	Correct	4 ms	3156 KB	Output is correct
55	Correct	5 ms	3156 KB	Output is correct
56	Execution timed out	1056 ms	3156 KB	Time limit exceeded
57	Halted	0 ms	0 KB	-

답안 #45924

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
21.0 / 21.0

Subtask #5
0 / 43.0