제출 #534858

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
534858		Paul_Liao_1457	Group Photo (JOI21_ho_t3)	C++14	12 / 100	514 ms	332 KiB

Main

// 還要更強
#include<iostream>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
#include<math.h>
#include<cstring>
#include<stack>
#include<string.h>
#include<random>
#include<algorithm>
#include<vector>

#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define INF (ll)(1e9)
#define pb push_back
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

using namespace std;

int bit[5005],a[5005],b[5005],n,pos[5005];

void add(int x){
    for(int i=x;i>0;i-=i&(-i)) bit[i]++;
}

int ask(int x){
    int r=0;
    for(int i=x;i<=n;i+=i&(-i)){
        r+=bit[i];
    }
    return r;
}

int cnt(){
    int ans=0;
    FOR(i,1,n+1) bit[i]=0;
    FOR(i,1,n+1){
        ans+=ask(b[i]);
        add(b[i]);
    }
    return ans;
}

bool check(vector<int> v){
    FOR(i,1,n)if(v[i]+2<=v[i-1]) return 0;
    return 1;
}

signed main(){
    AC;
    int res;
    cin>>n;
    FOR(i,1,n+1){
        cin>>a[i]; pos[a[i]]=i;
    }
    FOR(i,1,n+1){
        b[i]=a[i];
    }
    res=cnt();
    FOR(s,0,(1<<n)){
        int last=0;
        vector<int> v;
        FOR(i,0,n)if(s&(1<<i)){
            int tmp=i+1;
            while(tmp!=last){
                v.pb(tmp--);
            }
            last=i+1;
        }
        FOR(i,0,v.size()) b[pos[v[i]]]=i+1;
        res=min(res,cnt());
    }
    cout<<res<<endl;
}

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

Main.cpp: In function 'int main()':
Main.cpp:16:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 | #define FOR(i,a,b) for(int i=a;i<b;i++)
......
   74 |         FOR(i,0,v.size()) b[pos[v[i]]]=i+1;
      |             ~~~~~~~~~~~~         
Main.cpp:74:9: note: in expansion of macro 'FOR'
   74 |         FOR(i,0,v.size()) b[pos[v[i]]]=i+1;
      |         ^~~

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 0 / 32
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36