제출 #696160

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
696160		n0sk1ll	곤돌라 (IOI14_gondola)	C++14	0 / 100	1 ms	212 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]-i);
    return ((int)ost.size()==1);
    
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    return 0;
}

int countReplacement(int n, int inputSeq[])
{
    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]-i);
      |     ^~

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