oj.uz

Submission #41699

# Submission time Handle Problem Language Result Execution time Memory
41699 2018-02-20T19:09:19 Z repeating Jakarta Skyscrapers (APIO15_skyscraper) C++11
22 / 100
 35 ms 39404 KB 
#include <bits/stdc++.h>

#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define SF(x) scanf("%Id",&x)
#define SF2(x,y) scanf("%Id%Id",&x,&y)
#define SF3(x,y,z) scanf("%I64d%I64d%I64d",&x,&y,&z)
#define SF4(x,y,z,o) scanf("%I64d%I64d%I64d%I64d",&x,&y,&z,&o)
#define all(v) v.begin(),v.end()

using namespace std;
const long long INF = 1e9;
const long long MOD = 1e9+7;
const int MX=4015;
int n,m;
int xx[MX],y[MX];
const int sq=2002;
ll dp[2205][2224];
vector<int> v[MX];
ll DP(int x,int j){
    if(x<0||x>=n)R INF;
//    cout<<x<<" "<<j<<endl;
    if(x==xx[1])R 0;
    ll &ret=dp[x][j];
    if(ret!=-1)R ret;
    ret=INF;
    ret=min(ret,DP(x+j,j)+1);
    ret=min(ret,DP(x-j,j)+1);
    for(auto i : v[x])
            {ret=min(ret,DP(x,i));}
    R ret;

}
int main(){
    MEM(dp,-1);
    cin>>n>>m;
    for(int i=0;i<m;i++){
        cin>>xx[i]>>y[i];
        v[xx[i]].pb(y[i]);
    }
    if(DP(xx[0],0)==INF)cout<<-1;
    else
    cout<<DP(xx[0],0);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 38776 KB Output is correct
2 Correct 31 ms 39008 KB Output is correct
3 Correct 29 ms 39008 KB Output is correct
4 Correct 31 ms 39008 KB Output is correct
5 Correct 30 ms 39008 KB Output is correct
6 Correct 29 ms 39008 KB Output is correct
7 Correct 29 ms 39076 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 39076 KB Output is correct
2 Correct 31 ms 39076 KB Output is correct
3 Correct 29 ms 39076 KB Output is correct
4 Correct 30 ms 39076 KB Output is correct
5 Correct 29 ms 39076 KB Output is correct
6 Correct 30 ms 39120 KB Output is correct
7 Correct 31 ms 39120 KB Output is correct
8 Correct 29 ms 39120 KB Output is correct
9 Correct 29 ms 39120 KB Output is correct
10 Correct 31 ms 39120 KB Output is correct
11 Correct 31 ms 39276 KB Output is correct
12 Correct 31 ms 39276 KB Output is correct
13 Correct 30 ms 39276 KB Output is correct
14 Correct 32 ms 39276 KB Output is correct
15 Correct 30 ms 39276 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 39276 KB Output is correct
2 Correct 29 ms 39276 KB Output is correct
3 Correct 31 ms 39276 KB Output is correct
4 Correct 29 ms 39276 KB Output is correct
5 Correct 28 ms 39276 KB Output is correct
6 Correct 30 ms 39276 KB Output is correct
7 Correct 30 ms 39276 KB Output is correct
8 Correct 29 ms 39276 KB Output is correct
9 Correct 31 ms 39276 KB Output is correct
10 Correct 29 ms 39276 KB Output is correct
11 Correct 30 ms 39276 KB Output is correct
12 Correct 30 ms 39276 KB Output is correct
13 Correct 29 ms 39276 KB Output is correct
14 Correct 30 ms 39276 KB Output is correct
15 Correct 31 ms 39276 KB Output is correct
16 Correct 30 ms 39276 KB Output is correct
17 Correct 31 ms 39404 KB Output is correct
18 Correct 30 ms 39404 KB Output is correct
19 Correct 34 ms 39404 KB Output is correct
20 Correct 30 ms 39404 KB Output is correct
21 Correct 29 ms 39404 KB Output is correct
22 Correct 29 ms 39404 KB Output is correct
23 Incorrect 32 ms 39404 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 39404 KB Output is correct
2 Correct 29 ms 39404 KB Output is correct
3 Correct 29 ms 39404 KB Output is correct
4 Correct 29 ms 39404 KB Output is correct
5 Correct 29 ms 39404 KB Output is correct
6 Correct 29 ms 39404 KB Output is correct
7 Correct 30 ms 39404 KB Output is correct
8 Correct 30 ms 39404 KB Output is correct
9 Correct 28 ms 39404 KB Output is correct
10 Correct 29 ms 39404 KB Output is correct
11 Correct 30 ms 39404 KB Output is correct
12 Correct 32 ms 39404 KB Output is correct
13 Correct 30 ms 39404 KB Output is correct
14 Correct 30 ms 39404 KB Output is correct
15 Correct 30 ms 39404 KB Output is correct
16 Correct 29 ms 39404 KB Output is correct
17 Correct 31 ms 39404 KB Output is correct
18 Correct 29 ms 39404 KB Output is correct
19 Correct 30 ms 39404 KB Output is correct
20 Correct 30 ms 39404 KB Output is correct
21 Correct 30 ms 39404 KB Output is correct
22 Correct 30 ms 39404 KB Output is correct
23 Incorrect 30 ms 39404 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 39404 KB Output is correct
2 Correct 29 ms 39404 KB Output is correct
3 Correct 29 ms 39404 KB Output is correct
4 Correct 29 ms 39404 KB Output is correct
5 Correct 29 ms 39404 KB Output is correct
6 Correct 30 ms 39404 KB Output is correct
7 Correct 29 ms 39404 KB Output is correct
8 Correct 30 ms 39404 KB Output is correct
9 Correct 30 ms 39404 KB Output is correct
10 Correct 32 ms 39404 KB Output is correct
11 Correct 34 ms 39404 KB Output is correct
12 Correct 31 ms 39404 KB Output is correct
13 Correct 33 ms 39404 KB Output is correct
14 Correct 31 ms 39404 KB Output is correct
15 Correct 31 ms 39404 KB Output is correct
16 Correct 29 ms 39404 KB Output is correct
17 Correct 31 ms 39404 KB Output is correct
18 Correct 29 ms 39404 KB Output is correct
19 Correct 28 ms 39404 KB Output is correct
20 Correct 30 ms 39404 KB Output is correct
21 Correct 35 ms 39404 KB Output is correct
22 Correct 30 ms 39404 KB Output is correct
23 Incorrect 32 ms 39404 KB Output isn't correct
24 Halted 0 ms 0 KB -