Submission #309288

#	Time	Username	Problem	Language	Result	Execution time	Memory
309288		jainbot27	Gondola (IOI14_gondola)	C++17	20 / 100	20 ms	1024 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

int valid(int n, int* inputSeq){
    int copy[n];
    F0R(i, n){
        copy[i] = inputSeq[i]-1;
    }
    F0R(i, n-1){
        if(copy[i+1]==(copy[i]+1)%n)
            continue;
        return 0;
    }
    if((copy[n-1]+1)%n!=copy[0])
        return 0;
    return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){

}

int countReplacement(int n, int inputSeq[]){

}

// int32_t main(){
//     ios_base::sync_with_stdio(0); cin.tie(0);


//     return 0;
// }

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:49:1: warning: no return statement in function returning non-void [-Wreturn-type]
   49 | }
      | ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:53:1: warning: no return statement in function returning non-void [-Wreturn-type]
   53 | }
      | ^

• 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