oj.uz

Submission #923920

# Submission time Handle Problem Language Result Execution time Memory
923920 2024-02-08T06:35:23 Z ezzzay Jakarta Skyscrapers (APIO15_skyscraper) C++14
0 / 100
 1 ms 412 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define ff first
#define ss second
#define pb push_back
#define inf 1e17
const int N=15;
int arr[N][N];
int cur[N],pw[N];
signed main(){
    int n,m;
    cin>>n>>m;
    vector<int>v;
    for(int i=0;i<m;i++){
        cin>>cur[i]>>pw[i];
        
    }
    for(int i=0;i<m;i++)v.pb(i);
    int ans=INT_MAX;
    do{
        if(v[m-1]!=1 or v[0]!=0)continue;
        
        int s=0;
        for(int i=0;i<m-1;i++){
            int k=abs(cur[v[i]]-cur[v[i+1]]);
            int h=k/pw[i];
            if(k%pw[i])h++;
            s+=h;
        };
        ans=min(ans,s);
        
    }while(next_permutation(v.begin(),v.end()));
    cout<<ans;
    
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 412 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -