Submission #243406

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
243406	2020-07-01T03:32:30 Z	aloo123	Gondola (IOI14_gondola)	C++14	Compilation error	0 ms	0 KB

gondola

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <gondola.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> os;
 
 
const ll INF = 1e18;
const ll N =(1e5+5); // TODO : change value as per problem
const ll MOD = 1e9+7;


int valid(int n, int a[]){
    bool done[n+1];
    ll spare = n+1;
    for(int i =1;i<=n;i++) done[i] = false;
    for(int i = 0;i<n-1;i++){
        done[a[i]] = true;
        ll nxt = a[i]+1;
        if(nxt > n) nxt = 1;
        if(a[i+1] == nxt){
            if(done[nxt]) return 0;
        }
        else if(a[i+1] != spare){
            return 0;
        }
        else if(a[i+1] == spare){
            spare++;
        }
    }
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) return -2;
int countReplacement(int n, int inputSeq[]) return -33;

Compilation message

gondola.cpp: In function 'long long int replacement(long long int, long long int*, long long int*)':
gondola.cpp:78:71: error: expected identifier before '-' token
 int replacement(int n, int gondolaSeq[], int replacementSeq[]) return -2;
                                                                       ^
gondola.cpp:78:64: error: named return values are no longer supported
 int replacement(int n, int gondolaSeq[], int replacementSeq[]) return -2;
                                                                ^~~~~~
gondola.cpp:79:55: error: expected '{' at end of input
 int countReplacement(int n, int inputSeq[]) return -33;
                                                       ^
gondola.cpp:79:55: warning: no return statement in function returning non-void [-Wreturn-type]
gondola.cpp: In function 'long long int valid(long long int, long long int*)':
gondola.cpp:77:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^