제출 #289352

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
289352		peti1234	고대 책들 (IOI17_books)	C++17	100 / 100	285 ms	49248 KiB

books

#include <bits/stdc++.h>

using namespace std;
const int c=1000002;
bool v[c];
long long sum;
int n, t[c], kezd, veg, kis, nagy, bh=c, jh, mini[c], maxi[c], x[3], y[3];
vector<int> akt;
void dfs(int a) {
    if (v[a]) return;
    v[a]=true, akt.push_back(a);
    kis=min(kis, a), nagy=max(nagy, a);
    dfs(t[a]);
}
void le() {
    int pos=mini[kezd], d=kezd, db=0, v=maxi[kezd];
    //cout << "kezdes " << bh << " " << pos << " " << v << " " << veg << "\n";
    while(bh<pos && v<=veg) {
        while(d>pos) {
            d--;
            pos=min(pos, mini[d]);
            v=max(v, maxi[d]);
        }
        if (bh<pos && v<=veg) {
            db++;
            pos--, pos=mini[pos], v=max(v, maxi[pos]);
        }
        while(d>pos) {
            d--;
            pos=min(pos, mini[d]);
            v=max(v, maxi[d]);
        }
    }
    x[0]=db;
    if (v>veg) x[1]=pos, x[2]=v;
    else x[1]=-1;
}
void fel() {
    int pos=maxi[veg], d=veg, db=0, k=mini[kezd];
    while(kezd<=k && pos<jh) {
        while(d<pos) {
            d++;
            pos=max(pos, maxi[d]);
            k=min(k, mini[d]);
        }
        if (k<=kezd && pos<jh) {
            db++;
            pos++, pos=maxi[pos], k=min(k, mini[pos]);
        }
        while(d<pos) {
            d++;
            pos=max(pos, maxi[d]);
            k=min(k, mini[d]);
        }
    }
    y[0]=db;
}
long long minimum_walk(vector<int> p, int s) {
    n=p.size(), kezd=s, veg=s, kis=s, nagy=s, bh, jh;
    for (int i=0; i<n; i++) {
        t[i]=p[i], sum+=abs(p[i]-i);
    }
    //cout << "sima " << sum << "\n";
    for (int i=0; i<n; i++) {
        if (t[i]!=i) {
            if (bh==c) bh=i;
            jh=i;
        }
        kis=n, nagy=0;
        dfs(i);
        for (int i=0; i<akt.size(); i++) mini[akt[i]]=kis, maxi[akt[i]]=nagy;
        akt.clear();
    }
    for (int i=0; i<n; i++) {
        //cout << mini[i] << " " << maxi[i] << "\n";
    }
    while(bh<kezd || veg<jh) {
        int p=mini[kezd], q=maxi[veg];
        while(p<kezd || veg<q) {
            p=min({p, mini[kezd], mini[veg]}), q=max({q, maxi[kezd], maxi[veg]});
            if (kezd>p) kezd--;
            if (veg<q) veg++;
        }
        //cout << kezd << " " << veg << endl;
        le(), fel();
        //cout << "ert " << x[0] << " " << y[0] << " " << x[1] << " " << x[2] << "\n";
        if (x[1]==-1) {
            sum+=2*(x[0]+y[0]);
            break;
        }
        sum+=2*min(x[0], y[0]);
        while(x[1]<kezd || veg<x[2]) {
            x[1]=min({x[1], mini[kezd], mini[veg]}), x[2]=max({x[2], maxi[kezd], maxi[veg]});
            if (kezd>x[1]) kezd--;
            if (veg<x[2]) veg++;
        }
    }
    return sum;
}

컴파일 시 표준 에러 (stderr) 메시지

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:59:51: warning: right operand of comma operator has no effect [-Wunused-value]
   59 |     n=p.size(), kezd=s, veg=s, kis=s, nagy=s, bh, jh;
      |                                                   ^~
books.cpp:59:53: warning: right operand of comma operator has no effect [-Wunused-value]
   59 |     n=p.size(), kezd=s, veg=s, kis=s, nagy=s, bh, jh;
      |                                                     ^
books.cpp:71:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |         for (int i=0; i<akt.size(); i++) mini[akt[i]]=kis, maxi[akt[i]]=nagy;
      |                       ~^~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 10 / 10
• Subtask 3: 28 / 28
• Subtask 4: 20 / 20
• Subtask 5: 30 / 30