oj.uz

답안 #568628

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
568628 2022-05-25T20:17:08 Z urosk 정렬하기 (IOI15_sorting) C++14
20 / 100
 1 ms 468 KB 
#include "sorting.h"
#define here cerr<<"===========================================\n"
#include <bits/stdc++.h>
#define ld double
#define ll int
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
using namespace std;

#define maxn 105
ll n,m;
ll a[maxn];
ll p[maxn];

bool sorted(){
    for(ll i = 1;i<n;i++) if(a[i]>a[i+1]) return 0;
    return 1;
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    n = N;
    m = M;
    for(ll i = 1;i<=n;i++) a[i] = S[i-1]+1;
    for(ll i = 1;i<=n;i++) p[a[i]] = i;
    ll sum = 0;
    for(ll i = 0;i<m;i++) sum+=X[i] + Y[i];
    ceri(a,1,n);
    if(sum==0){
        for(ll i = 1;i<=n;i++){
            if(sorted()) return i-1;
            P[i-1] = i-1;
            Q[i-1] = p[i]-1;
            ll x = a[i];
            a[p[i]] = a[i];
            a[i] = i;
            swap(p[i],p[x]);
        }
        return n;
    }
    ll cnt = 0;
    ll swps = 0;
    for(ll i = 1;i<=n;i++){
        if(sorted()) return swps;
        if(i==2&&cnt==0){
            cnt++;
            P[swps] = 0;
            Q[swps] = 0;
            swps++;
            i--;
            swap(a[1],a[2]);
            continue;
        }
        P[swps] = i-1;
        Q[swps] = p[i]-1;
        ll x = a[i];
        a[p[i]] = a[i];
        a[i] = i;
        swps++;
        swap(p[i],p[x]);
        swap(a[1],a[2]);
    }
    if(sorted()) return swps;
    P[swps] = 0;
    Q[swps] = 0;
    swps++;
    return swps;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -