oj.uz

답안 #45799

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
45799 2018-04-16T06:33:41 Z TheDarkning Jakarta Skyscrapers (APIO15_skyscraper) C++17
10 / 100
 29 ms 32000 KB 
/**
                  ▄█▀ ▀█▀ ▄▀▄ █▀ █▄█▄█ ▄▀▄ █▀ ▄█▀
                  <⇋⇋⇋⋛∰≓⊂(⌒,_ゝ⌒)⊃≓∰⋛⇋⇋⇋>

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

**/

#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 = 1e6 + 5;
const int inf = 1e9 + 7;

long long n, m, p, b, x, y, cnt, dp[ 2000 ][ 2000 ];

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

   for( int i = 1; i < 2000; i++ )
      for( int j = 1; j < 2000; j++ )
         dp[ i ][ j ] = inf;

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

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

      cnt = 0;
      for( int j = p; j <= n; j += b )
      {
         dp[p][ j ] = min( dp[p][ j ], cnt );
         cnt++;
      }
      cnt = 0;
      for( int j = p; j > 0; j -= b )
      {
         dp[p][j] = min ( dp[p][ j ], cnt );
         cnt++;
      }
   }
   for( int i = 1; i <= n; i++ )
      for( int j = 1; j <= n; j++ )
         for( int k = 1; k <= n; k++ )
            dp[i][j] = min( dp[i][j], dp[i][k] + dp[k][j] );

   if( dp[y][x] == inf )
//      assert( 0 );
      dp[y][x] = -1;

   cout << dp[y][x];
}

Compilation message

skyscraper.cpp:38:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:40:24: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
    scanf("%d%d", &n, &m);
                  ~~    ^
skyscraper.cpp:40:24: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'long long int*' [-Wformat=]
skyscraper.cpp:48:27: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
       scanf("%d%d", &p, &b);
                     ~~    ^
skyscraper.cpp:48:27: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'long long int*' [-Wformat=]
skyscraper.cpp:40: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:48: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 24 ms 31608 KB Output is correct
2 Correct 24 ms 31768 KB Output is correct
3 Correct 23 ms 31768 KB Output is correct
4 Correct 23 ms 31768 KB Output is correct
5 Correct 27 ms 31768 KB Output is correct
6 Correct 22 ms 31768 KB Output is correct
7 Correct 24 ms 31768 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 31768 KB Output is correct
2 Correct 24 ms 31768 KB Output is correct
3 Correct 29 ms 31768 KB Output is correct
4 Correct 23 ms 31800 KB Output is correct
5 Correct 25 ms 32000 KB Output is correct
6 Correct 23 ms 32000 KB Output is correct
7 Correct 23 ms 32000 KB Output is correct
8 Correct 24 ms 32000 KB Output is correct
9 Correct 24 ms 32000 KB Output is correct
10 Correct 26 ms 32000 KB Output is correct
11 Correct 25 ms 32000 KB Output is correct
12 Incorrect 25 ms 32000 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 32000 KB Output is correct
2 Correct 22 ms 32000 KB Output is correct
3 Correct 22 ms 32000 KB Output is correct
4 Correct 22 ms 32000 KB Output is correct
5 Correct 24 ms 32000 KB Output is correct
6 Correct 23 ms 32000 KB Output is correct
7 Correct 23 ms 32000 KB Output is correct
8 Correct 23 ms 32000 KB Output is correct
9 Correct 23 ms 32000 KB Output is correct
10 Correct 25 ms 32000 KB Output is correct
11 Correct 26 ms 32000 KB Output is correct
12 Incorrect 25 ms 32000 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 32000 KB Output is correct
2 Correct 23 ms 32000 KB Output is correct
3 Correct 23 ms 32000 KB Output is correct
4 Correct 23 ms 32000 KB Output is correct
5 Correct 29 ms 32000 KB Output is correct
6 Correct 23 ms 32000 KB Output is correct
7 Correct 23 ms 32000 KB Output is correct
8 Correct 23 ms 32000 KB Output is correct
9 Correct 23 ms 32000 KB Output is correct
10 Correct 25 ms 32000 KB Output is correct
11 Correct 25 ms 32000 KB Output is correct
12 Incorrect 26 ms 32000 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 32000 KB Output is correct
2 Correct 23 ms 32000 KB Output is correct
3 Correct 26 ms 32000 KB Output is correct
4 Correct 23 ms 32000 KB Output is correct
5 Correct 23 ms 32000 KB Output is correct
6 Correct 25 ms 32000 KB Output is correct
7 Correct 24 ms 32000 KB Output is correct
8 Correct 23 ms 32000 KB Output is correct
9 Correct 23 ms 32000 KB Output is correct
10 Correct 25 ms 32000 KB Output is correct
11 Correct 26 ms 32000 KB Output is correct
12 Incorrect 26 ms 32000 KB Output isn't correct
13 Halted 0 ms 0 KB -