oj.uz

Submission #872720

# Submission time Handle Problem Language Result Execution time Memory
872720 2023-11-13T15:36:39 Z HuyQuang_re_Zero Gondola (IOI14_gondola) C++14
25 / 100
 28 ms 7036 KB 
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define TII pair <treap*,treap*>
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x))
#include "gondola.h"
using namespace std;
int n,i,a[100005];
int valid(int n,int a[])
{
    int last_u=0,last_i=0;
    map <int,int> d;
    for(i=0;i<n;i++)
    {
        int u=a[i];
        if(d[u]) return 0;
        d[u]=1;
        if(u>n) continue;
        if(last_u>0 && (u-last_u+n)%n!=(i-last_i+n)%n)
            return 0;
        last_u=u; last_i=i;
    }
    return 1;
}
int m,res[250005];
int replacement(int n,int a[], int res[])
{
    cin>>n;
    int ma=0;
    map <int,int> d;
    for(i=0;i<n;i++) ma=max(ma,a[i]),d[a[i]]=1;
    int m=0;
    for(i=1;i<=ma;i++)
        if(d[i]==0) res[m++]=i;
    return m;
}

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

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

/*
int main()
{
    freopen("gondola.inp","r",stdin);
    freopen("gondola.out","w",stdout);
    cin>>n;
    for(i=0;i<n;i++) cin>>a[i];
    int m=replacement(n,a,res);
    for(i=0;i<m;i++) cout<<res[i]<<" ";
}
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 12 ms 4444 KB Output is correct
7 Correct 7 ms 3272 KB Output is correct
8 Correct 20 ms 6492 KB Output is correct
9 Correct 6 ms 3784 KB Output is correct
10 Correct 28 ms 7004 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2452 KB Output is correct
6 Correct 10 ms 4604 KB Output is correct
7 Correct 8 ms 3280 KB Output is correct
8 Correct 20 ms 6496 KB Output is correct
9 Correct 6 ms 3672 KB Output is correct
10 Correct 24 ms 7036 KB Output is correct
11 Correct 1 ms 2400 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 3 ms 2652 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 7 ms 3188 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Incorrect 1 ms 2396 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Incorrect 1 ms 2396 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 440 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -