제출 #132183

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
132183		miguel	곤돌라 (IOI14_gondola)	C++14	25 / 100	16 ms	2060 KiB

gondola

#include<bits/stdc++.h>
#include<gondola.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
const ll mod = 998244353;
int n;

int nxt(int lol, int n){
    if(lol<n-1) return lol+1;
    else return 0;
}

int nxtg(int lol, int n){
    if(lol==n) return 1;
    else return (lol+1);
}

int valid(int n, int v[]){
    int cnt[250001];
    memset(cnt, 0, sizeof cnt);
    int mn=250001, mx=0, br=0, idx;
    for(int i=0; i<n; i++){
        if(mn>v[i]){
            mn=v[i];
            idx=i;
        }
        mx=max(mx, v[i]);
    }
    int xd=idx;
    if(v[xd]<=n && v[xd]!=mn+((xd-idx+n)%n)) return 0;
    cnt[v[xd]]++;
    xd=nxt(xd, n);
    while(xd!=idx){
        if(v[xd]<=n && v[xd]!=mn+((xd-idx+n)%n)) return 0;
        cnt[v[xd]]++;
        xd=nxt(xd, n);
    }
    for(int i=1; i<=n; i++){
        if(cnt[i]>1) return 0;
    }
    for(int i=n+1; i<=mx; i++){
        if(cnt[i]!=1) return 0;
    }
    return 1;
}

int replacement(int n, int v[], int s[]){
    int mn=250001, mx=0, idx;
    vi cnt;
    cnt.pb(n);
    for(int i=0; i<n; i++){
        if(v[i]>n) cnt.pb(v[i]);
        if(mn>v[i]){
            mn=v[i];
            idx=i;
        }
        mx=max(mx, v[i]);
    }
    cnt[n]=1;
    idx=(idx-(mn-1)+n)%n;
    int xd=idx;
    if(v[xd]>n){
        s[v[xd]-(n+1)]=1+((xd-idx+n)%n);
    }
    xd=nxt(xd, n);
    while(xd!=idx){
        if(v[xd]>n){
            //cout<<v[xd]-n-1<<" "<<1+((xd-idx+n)%n)<<"\n";
            int lst=v[xd];
            lst=(*(--lower_bound(cnt.begin(), cnt.end(), lst)));
            //while(cnt[lst-1]==0) lst--;
            lst++;
            s[lst-(n+1)]=1+((xd-idx+n)%n);
            while(lst!=v[xd]){
                lst++;
                s[lst-(n+1)]=lst-1;
            }
            ///if(xd>=idx) s[v[xd]-(n+1)]=1+(xd-idx);
            ///else s[v[xd]-(n+1)]=1+(n-idx)+1+(xd);
        }
        xd=nxt(xd, n);
    }
    //cout<<mx-n<<endl;
    //for(int i=0; i<(mx-n); i++) cout<<s[i]<<" ";
    return mx-n;
}

int countReplacement( int n, int num[] ) {return 0;}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:30:26: warning: unused variable 'br' [-Wunused-variable]
     int mn=250001, mx=0, br=0, idx;
                          ^~
gondola.cpp:42:13: warning: 'idx' may be used uninitialized in this function [-Wmaybe-uninitialized]
     while(xd!=idx){
           ~~^~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:69:13: warning: 'idx' may be used uninitialized in this function [-Wmaybe-uninitialized]
     idx=(idx-(mn-1)+n)%n;
          ~~~^~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10