Submission #230265

# Submission time Handle Problem Language Result Execution time Memory
230265 2020-05-09T12:47:38 Z Masterdan Gondola (IOI14_gondola) C++14
15 / 100
17 ms 1536 KB
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector <int> vi;
typedef pair <int, int> ii;
typedef vector <ii> vii;
#define mp make_pair
#define pb push_back
#define all(a) a.begin (),a.end ()
#define MAX 1000000000
#define MIN -1
#define F first
#define S second
int valid(int n, int inputSeq[])
{
  int sw=0;
  int c=0;
  int v[n+1];
  for(int i=0;i<n;i++)v[i]=inputSeq[i];
  //v=inputSeq;
  for(int i=1;i<n;i++){
    if(v[i]<=v[i-1])c++;
    if(c==2)return 0;
  }
  return 1;
}
 
//----------------------
 
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    vi v;
    int sw=0;
    for(int i=0;i<n;i++)v.pb(gondolaSeq[i]);
    sort(all(v));
    for(int i=0;i<n;i++){
        if(v[i]!=i+1){replacementSeq[0]=i+1;
        sw=1;
        break;
        }
    }
    return sw;
}
 
//----------------------
 
int countReplacement(int n, int inputSeq[])
{
    return -3;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:17:7: warning: unused variable 'sw' [-Wunused-variable]
   int sw=0;
       ^~
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 9 ms 896 KB Output is correct
7 Correct 16 ms 1536 KB Output is correct
8 Correct 14 ms 1280 KB Output is correct
9 Correct 8 ms 680 KB Output is correct
10 Correct 15 ms 1536 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 10 ms 896 KB Output is correct
7 Correct 17 ms 1536 KB Output is correct
8 Correct 14 ms 1280 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 15 ms 1408 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Incorrect 5 ms 256 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 416 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Incorrect 4 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Incorrect 5 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -