Submission #385848

#	Time	Username	Problem	Language	Result	Execution time	Memory
385848		mehrdad_sohrabi	Gondola (IOI14_gondola)	C++14	10 / 100	13 ms	1892 KiB

gondola

// Black lives matter
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
typedef long long int ll;
typedef complex<double> point;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
//#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
const int N=25e4+10;
int32_t valid(int32_t n, int32_t input[]){
    ll id=-1;
    for (int i=0;i<n;i++){
        if (input[i]<=n){
            id=i;
        }
    }
    ll z=input[id]-id+n;
    z%=n;
    for (int i=0;i<n;i++){
        if (input[i]<=n){
            ll f=input[i]-i+n;
            f%=n;
            if (f!=z) return 0;
        }
    }
    vector <int> a;
    for (int i=0;i<n;i++){
        a.pb(input[i]);
    }
    return 1;
}

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

int32_t countReplacement(int32_t n, int32_t inputSeq[]){
    return 0;
}
/*
int32_t in[N];
int32_t main(){
    ll n;
    cin >> n;
    for (int i=1;i<=n;i++){
        cin >> in[i-1];
    }
    kill(valid(n,in));
}
*/
/*

int gondolaSequence[100001];
int replacementSequence[250001];

int32_t main()
{
  int i, n, tag;
  int nr;
  assert(scanf("%d", &tag)==1);
  assert(scanf("%d", &n)==1);
  for(i=0;i< n;i++)
    assert( scanf("%d", &gondolaSequence[i]) ==1);

  switch (tag){
  case 1: case 2: case 3:
    printf("%d\n", valid(n, gondolaSequence));
    break;

  case 4: case 5: case 6:
    nr = replacement(n, gondolaSequence, replacementSequence);
    printf("%d ", nr);
    if (nr > 0)
      {
	for (i=0; i<nr-1; i++)
	  printf("%d ", replacementSequence[i]);
	printf("%d\n", replacementSequence[nr-1]);
      }
    else printf("\n");
    break;

  case 7: case 8: case 9: case 10:
    printf("%d\n",  countReplacement(n, gondolaSequence));
    break;
  }

  return 0;
}
*/

• 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