답안 #45878 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
45878	2018-04-16T10:06:21 Z	TheDarkning	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1000 ms	5796 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 <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, dp[ 2000 ][ 2000 ];
vector < int > w[N];

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 ), p( n + 1 );
   d[ s ] = 0;
   set < pair < int, int > > q;

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

   while( !q.empty() )
   {
      int v = q.begin() -> sc;
      q.erase( q.begin() );
      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 ] )
            {
               q.erase( mk( d[ to ], to ) );
               d[ to ] = d[ v ] + cnt;
               q.insert( 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 ] )
            {
               q.erase( mk( d[ to ], to ) );
               d[ to ] = d[ v ] + cnt;
               q.insert( mk( d[ to ], to ) );
            }
         }
      }
   }
   if( d[ x ] == inf )
      d[ x ] = -1;
   cout << d[ x ];
}

Compilation message

skyscraper.cpp:39:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:41: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:45: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	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	540 KB	Output is correct
4	Correct	2 ms	540 KB	Output is correct
5	Correct	2 ms	540 KB	Output is correct
6	Correct	2 ms	540 KB	Output is correct
7	Correct	2 ms	632 KB	Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
0 / 43.0

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

답안 #45878

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