Submission #45922

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
45922	2018-04-16T13:37:47 Z	TheDarkning	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	190 ms	1020 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 = 2e3 + 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 + 1, 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	448 KB	Output is correct
5	Correct	2 ms	500 KB	Output is correct
6	Correct	2 ms	500 KB	Output is correct
7	Correct	2 ms	500 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	500 KB	Output is correct
2	Correct	2 ms	500 KB	Output is correct
3	Correct	2 ms	500 KB	Output is correct
4	Correct	2 ms	500 KB	Output is correct
5	Correct	2 ms	500 KB	Output is correct
6	Correct	2 ms	500 KB	Output is correct
7	Correct	2 ms	500 KB	Output is correct
8	Correct	2 ms	532 KB	Output is correct
9	Correct	2 ms	580 KB	Output is correct
10	Correct	2 ms	580 KB	Output is correct
11	Correct	2 ms	584 KB	Output is correct
12	Correct	3 ms	584 KB	Output is correct
13	Correct	3 ms	584 KB	Output is correct
14	Correct	2 ms	584 KB	Output is correct
15	Correct	2 ms	588 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	588 KB	Output is correct
2	Correct	2 ms	588 KB	Output is correct
3	Correct	2 ms	588 KB	Output is correct
4	Correct	2 ms	588 KB	Output is correct
5	Correct	2 ms	588 KB	Output is correct
6	Correct	2 ms	588 KB	Output is correct
7	Correct	2 ms	592 KB	Output is correct
8	Correct	2 ms	592 KB	Output is correct
9	Correct	2 ms	592 KB	Output is correct
10	Correct	2 ms	592 KB	Output is correct
11	Correct	2 ms	592 KB	Output is correct
12	Correct	3 ms	736 KB	Output is correct
13	Correct	3 ms	736 KB	Output is correct
14	Correct	2 ms	736 KB	Output is correct
15	Correct	2 ms	736 KB	Output is correct
16	Correct	2 ms	736 KB	Output is correct
17	Correct	3 ms	736 KB	Output is correct
18	Correct	2 ms	736 KB	Output is correct
19	Correct	2 ms	736 KB	Output is correct
20	Correct	16 ms	876 KB	Output is correct
21	Correct	2 ms	876 KB	Output is correct
22	Correct	2 ms	876 KB	Output is correct
23	Correct	3 ms	876 KB	Output is correct
24	Correct	3 ms	876 KB	Output is correct
25	Correct	3 ms	876 KB	Output is correct
26	Correct	2 ms	876 KB	Output is correct
27	Correct	2 ms	876 KB	Output is correct
28	Correct	2 ms	876 KB	Output is correct
29	Correct	3 ms	876 KB	Output is correct
30	Correct	3 ms	876 KB	Output is correct
31	Correct	3 ms	876 KB	Output is correct
32	Correct	2 ms	876 KB	Output is correct
33	Correct	4 ms	876 KB	Output is correct
34	Correct	3 ms	876 KB	Output is correct

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	876 KB	Output is correct
2	Correct	2 ms	876 KB	Output is correct
3	Correct	2 ms	876 KB	Output is correct
4	Correct	2 ms	876 KB	Output is correct
5	Correct	2 ms	876 KB	Output is correct
6	Correct	2 ms	876 KB	Output is correct
7	Correct	2 ms	876 KB	Output is correct
8	Correct	2 ms	876 KB	Output is correct
9	Correct	2 ms	876 KB	Output is correct
10	Correct	2 ms	876 KB	Output is correct
11	Correct	2 ms	876 KB	Output is correct
12	Correct	3 ms	876 KB	Output is correct
13	Correct	3 ms	876 KB	Output is correct
14	Correct	2 ms	876 KB	Output is correct
15	Correct	2 ms	876 KB	Output is correct
16	Correct	2 ms	876 KB	Output is correct
17	Correct	3 ms	876 KB	Output is correct
18	Correct	2 ms	876 KB	Output is correct
19	Correct	2 ms	876 KB	Output is correct
20	Correct	14 ms	876 KB	Output is correct
21	Correct	2 ms	876 KB	Output is correct
22	Correct	3 ms	876 KB	Output is correct
23	Correct	2 ms	876 KB	Output is correct
24	Correct	4 ms	876 KB	Output is correct
25	Correct	2 ms	876 KB	Output is correct
26	Correct	2 ms	876 KB	Output is correct
27	Correct	2 ms	876 KB	Output is correct
28	Correct	3 ms	876 KB	Output is correct
29	Correct	3 ms	876 KB	Output is correct
30	Correct	3 ms	876 KB	Output is correct
31	Correct	3 ms	876 KB	Output is correct
32	Correct	2 ms	876 KB	Output is correct
33	Correct	5 ms	876 KB	Output is correct
34	Correct	5 ms	892 KB	Output is correct
35	Correct	9 ms	892 KB	Output is correct
36	Correct	3 ms	892 KB	Output is correct
37	Correct	8 ms	892 KB	Output is correct
38	Correct	11 ms	1020 KB	Output is correct
39	Correct	10 ms	1020 KB	Output is correct
40	Correct	10 ms	1020 KB	Output is correct
41	Correct	19 ms	1020 KB	Output is correct
42	Correct	8 ms	1020 KB	Output is correct
43	Correct	8 ms	1020 KB	Output is correct
44	Correct	184 ms	1020 KB	Output is correct
45	Correct	11 ms	1020 KB	Output is correct
46	Correct	10 ms	1020 KB	Output is correct

Subtask #5
0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1020 KB	Output is correct
2	Correct	2 ms	1020 KB	Output is correct
3	Correct	2 ms	1020 KB	Output is correct
4	Correct	2 ms	1020 KB	Output is correct
5	Correct	2 ms	1020 KB	Output is correct
6	Correct	2 ms	1020 KB	Output is correct
7	Correct	2 ms	1020 KB	Output is correct
8	Correct	2 ms	1020 KB	Output is correct
9	Correct	2 ms	1020 KB	Output is correct
10	Correct	2 ms	1020 KB	Output is correct
11	Correct	3 ms	1020 KB	Output is correct
12	Correct	3 ms	1020 KB	Output is correct
13	Correct	3 ms	1020 KB	Output is correct
14	Correct	3 ms	1020 KB	Output is correct
15	Correct	2 ms	1020 KB	Output is correct
16	Correct	2 ms	1020 KB	Output is correct
17	Correct	3 ms	1020 KB	Output is correct
18	Correct	2 ms	1020 KB	Output is correct
19	Correct	2 ms	1020 KB	Output is correct
20	Correct	14 ms	1020 KB	Output is correct
21	Correct	2 ms	1020 KB	Output is correct
22	Correct	2 ms	1020 KB	Output is correct
23	Correct	3 ms	1020 KB	Output is correct
24	Correct	4 ms	1020 KB	Output is correct
25	Correct	3 ms	1020 KB	Output is correct
26	Correct	2 ms	1020 KB	Output is correct
27	Correct	3 ms	1020 KB	Output is correct
28	Correct	2 ms	1020 KB	Output is correct
29	Correct	4 ms	1020 KB	Output is correct
30	Correct	3 ms	1020 KB	Output is correct
31	Correct	3 ms	1020 KB	Output is correct
32	Correct	3 ms	1020 KB	Output is correct
33	Correct	5 ms	1020 KB	Output is correct
34	Correct	4 ms	1020 KB	Output is correct
35	Correct	10 ms	1020 KB	Output is correct
36	Correct	3 ms	1020 KB	Output is correct
37	Correct	13 ms	1020 KB	Output is correct
38	Correct	15 ms	1020 KB	Output is correct
39	Correct	13 ms	1020 KB	Output is correct
40	Correct	11 ms	1020 KB	Output is correct
41	Correct	19 ms	1020 KB	Output is correct
42	Correct	11 ms	1020 KB	Output is correct
43	Correct	10 ms	1020 KB	Output is correct
44	Correct	190 ms	1020 KB	Output is correct
45	Correct	14 ms	1020 KB	Output is correct
46	Correct	11 ms	1020 KB	Output is correct
47	Runtime error	3 ms	1020 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
48	Halted	0 ms	0 KB	-

Submission #45922

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