Submission #292010

#	Time	Username	Problem	Language	Result	Execution time	Memory
292010		khangal	Gondola (IOI14_gondola)	C++14	10 / 100	55 ms	34040 KiB

gondola

#include<bits/stdc++.h>
#include "gondola.h"
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef int ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
typedef tree<ll , null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_multi_set;
typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b,c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z,t;
bool used[1234567];
pair<int,int> p[1234567];
vector<pl> vc[1234567];
vl vec,vv1,vv2;
// string s1,s;
// int sz[1234567],par[1234567];
int tr[5234567],par[1234567],maxx;
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
map<ll,ll> mp;

//----------------------

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

//----------------------

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

int valid(int n, int inputSeq[])
{
    int res=1; 
    for(int i=1;i<n;i++){
        if(inputSeq[i]==1 && inputSeq[i-1]!=n){
            res = 0;
        }
    }
    map<int,int> mp;
    for(int i=0;i<n;i++){
        mp[inputSeq[i]]++;
    }
    for(auto x:mp)if(x.ss>1)res=0;
    return res;
}

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