oj.uz

Submission #642003

# Submission time Handle Problem Language Result Execution time Memory
642003 2022-09-18T08:59:41 Z Tsiannis medians (balkan11_medians) C++14
5 / 100
 49 ms 5412 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 10000009
int main ()
{
  ll n; cin>>n;
  ll B[n];
  for (int i=0;i<n;i++){
     cin>>B[i];
  }
  ll A[2*n-1];
  ll V[2*n-1]={};
  A[0]=B[0];
  ll mn=1;
  ll mx=2*n-1;
  if (A[0]==1)
    mn=2;
  if (A[0]==2*n-1)
  mx--;
  V[A[0]]=1;
  ll idx=1;
  for (int i=1;i<=2*n-2;i+=2){
    if (B[idx]==B[idx-1])
    {
      A[i]=mn;
      V[A[i]]=1;
      A[i+1]=mx;
      V[A[i+1]]=1;
    }
    else
    {
      A[i]=B[idx];
      V[A[i]]=1;
      if (B[idx]<B[idx-1])
         A[i+1]=mn;
      else
         A[i+1]=mx;
      V[A[i+1]]=1;
    }
    idx++;
    while(V[mn])
    {
      mn++;
    }
    while(V[mx])
    {
      mx--;
    }
  }
  for (int i=0;i<2*n-1;i++)
    cout<<A[i]<<' ';
    cout<<endl;

    return 0;
}

Compilation message

medians.cpp: In function 'int main()':
medians.cpp:51:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   51 |   for (int i=0;i<2*n-1;i++)
      |   ^~~
medians.cpp:53:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   53 |     cout<<endl;
      |     ^~~~

Subtask #1
5.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Not a permutation
2 Incorrect 0 ms 212 KB Not a permutation
3 Incorrect 0 ms 212 KB Not a permutation
4 Incorrect 0 ms 212 KB Not a permutation
5 Incorrect 0 ms 212 KB Not a permutation
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB Not a permutation
8 Incorrect 1 ms 212 KB Not a permutation
9 Incorrect 0 ms 212 KB Not a permutation
10 Incorrect 0 ms 212 KB Not a permutation
11 Incorrect 0 ms 212 KB Not a permutation
12 Incorrect 1 ms 212 KB Not a permutation
13 Incorrect 1 ms 340 KB Not a permutation

Subtask #2
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Not a permutation
2 Incorrect 2 ms 468 KB Not a permutation
3 Incorrect 3 ms 596 KB Not a permutation
4 Incorrect 7 ms 980 KB Not a permutation
5 Incorrect 14 ms 1820 KB Not a permutation
6 Incorrect 35 ms 3472 KB Not a permutation
7 Incorrect 49 ms 5412 KB Not a permutation