제출 #696169

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
696169		n0sk1ll	곤돌라 (IOI14_gondola)	C++17	20 / 100	57 ms	6356 KiB

gondola

#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) (x).begin(),(x).end()
#define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
#define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
#define bff(i,a,b) for (int (i) = (b)-1; (i) >= (a); (i)--)
#define bfff(i,a,b) for (int (i) = (b); (i) >= (a); (i)--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
const int mod = 998244353;
//const int mod = 1000000007;







//Note to self: Check for overflow

#include "gondola.h"

int valid(int n, int a[])
{
    set<int> gondola;
    ff(i,0,n) gondola.insert(a[i]);
    if ((int)gondola.size()!=n) return 0;

    set<int> ost;
    ff(i,0,n) if (a[i]<=n) ost.insert((a[i]+n-i)%n);
    return ((int)ost.size()==1);
    
}

int gdet[256256];
int gdea[256256];
int og[100005];

int replacement(int n, int a[], int ans[])
{
    ff(i,0,n) og[i]=a[i];
    int p=0;
    while (p<n && a[p]>n) p++;
    if (p!=n)
    {
        ff(i,p+1,n) og[i]=(og[i-1]+1)%n;
        ff(i,0,p) og[i]=(og[(i+n-1)%n]+1)%n;
    }
    
    fff(i,0,250000) gdea[i]=-1,gdet[i]=-1;
    ff(i,0,n) gdet[og[i]]=i;
    ff(i,0,n) gdea[og[i]]=i;
    
    int k=0;
    bfff(i,0,250000) if (gdea[i]==-1) gdea[i]=gdea[i+1];
    fff(i,n+1,250000) if (gdea[i]!=-1) ans[k++]=og[gdea[i]],og[gdea[i]]=i;
    
    return k;
}

int countReplacement(int n, int a[])
{
    if (!valid(n,a)) return 0;
    
    
}

/*int main()
{
    FAST;

    while (true){

    int n; cin>>n;
    int a[n];
    ff(i,0,n) cin>>a[i];

    cout<<"? "<<valid(n,a)<<endl;

    }
}*/

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:42:5: note: in expansion of macro 'ff'
   42 |     ff(i,0,n) gondola.insert(a[i]);
      |     ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:46:5: note: in expansion of macro 'ff'
   46 |     ff(i,0,n) if (a[i]<=n) ost.insert((a[i]+n-i)%n);
      |     ^~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:57:5: note: in expansion of macro 'ff'
   57 |     ff(i,0,n) og[i]=a[i];
      |     ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:62:9: note: in expansion of macro 'ff'
   62 |         ff(i,p+1,n) og[i]=(og[i-1]+1)%n;
      |         ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:63:9: note: in expansion of macro 'ff'
   63 |         ff(i,0,p) og[i]=(og[(i+n-1)%n]+1)%n;
      |         ^~
gondola.cpp:13:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
gondola.cpp:66:5: note: in expansion of macro 'fff'
   66 |     fff(i,0,250000) gdea[i]=-1,gdet[i]=-1;
      |     ^~~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:67:5: note: in expansion of macro 'ff'
   67 |     ff(i,0,n) gdet[og[i]]=i;
      |     ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:68:5: note: in expansion of macro 'ff'
   68 |     ff(i,0,n) gdea[og[i]]=i;
      |     ^~
gondola.cpp:15:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define bfff(i,a,b) for (int (i) = (b); (i) >= (a); (i)--)
      |                              ^
gondola.cpp:71:5: note: in expansion of macro 'bfff'
   71 |     bfff(i,0,250000) if (gdea[i]==-1) gdea[i]=gdea[i+1];
      |     ^~~~
gondola.cpp:13:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
gondola.cpp:72:5: note: in expansion of macro 'fff'
   72 |     fff(i,n+1,250000) if (gdea[i]!=-1) ans[k++]=og[gdea[i]],og[gdea[i]]=i;
      |     ^~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:82:1: warning: control reaches end of non-void function [-Wreturn-type]
   82 | }
      | ^

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 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