Submission #1026275

#	Time	Username	Problem	Language	Result	Execution time	Memory
1026275		MarwenElarbi	Gondola (IOI14_gondola)	C++17	10 / 100	9 ms	2392 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
#define pb push_back
#define se second
#define fi first
const int nax=5e5+5;
const int MOD=1e9+7;
vector<pair<int,int>> tab;
int valid(int n, int inputSeq[])
{
    for (int i = 0; i < n; ++i)
    {
        if(inputSeq[i]<=n){
            tab.pb({inputSeq[i],i});
        }
    }
    bool test=true;
    bool nabba=false;
    for (int i = 1; i < tab.size(); ++i)
    {
        if(tab[i].fi<tab[i-1].fi){
            if(nabba) test=false;
            nabba=true;
            if(tab[i].fi>tab[i].se-tab[i-1].se) test=false;
        }
    }
    return test;
}

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

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

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

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

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:20:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for (int i = 1; i < tab.size(); ++i)
      |                     ~~^~~~~~~~~~~~

• 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