oj.uz

답안 #467101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
467101 2021-08-21T17:30:45 Z julian33 고대 책들 (IOI17_books) C++14
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);} 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxN=2e5+5; //make sure this is right
const int mod=1e9+7;

long long minimum_walk(vector<int> p, int s){
    int n=sz(p);
    ll ans=0;
    int most=0;
    int lst=-1;
    for(int i=0;i<n;i++){
        if(p[i]==i)
            continue;
        if(lst>i){
            ans+=lst-i;
            lst=-1;
        }
        most=i;
        int k=p[i]; int idx=i;
        while(p[idx]!=i){
            ans++;
            if(p[idx]>k)
                swap(k,p[idx]);
            idx++;
        }
        swap(k,p[idx]);
        lst=idx;
    }
    return ans+most+lst;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '8', found: '9'
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '8', found: '9'
4 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '8', found: '9'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '3304', found: '4415'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '8', found: '9'
4 Halted 0 ms 0 KB -