# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45766 | 2018-04-16T06:10:00 Z | TheDarkning | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 30 ms | 31872 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, 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++; 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] ); 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( n == 1 ) dp[1][2] = 0; if( dp[1][2] == inf ) dp[1][2] = -1; cout << dp[1][2]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 31608 KB | Output is correct |
2 | Correct | 25 ms | 31716 KB | Output is correct |
3 | Incorrect | 27 ms | 31788 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 31788 KB | Output is correct |
2 | Correct | 24 ms | 31868 KB | Output is correct |
3 | Incorrect | 28 ms | 31868 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 31868 KB | Output is correct |
2 | Correct | 23 ms | 31868 KB | Output is correct |
3 | Incorrect | 25 ms | 31868 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 31868 KB | Output is correct |
2 | Correct | 30 ms | 31868 KB | Output is correct |
3 | Incorrect | 23 ms | 31868 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 31868 KB | Output is correct |
2 | Correct | 25 ms | 31872 KB | Output is correct |
3 | Incorrect | 24 ms | 31872 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |