oj.uz

답안 #872758

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872758 2023-11-13T16:51:40 Z HuyQuang_re_Zero 곤돌라 (IOI14_gondola) C++14
55 / 100
 38 ms 6748 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],pos[250005],last[250005];
int replacement(int n,int a[], int res[])
{
    int ma=0,m=0;
    memset(last,-1,sizeof(last));
    for(i=0;i<n;i++) ma=max(ma,a[i]),last[a[i]]=i;
    for(i=1;i<=n;i++)
        if(last[i]>-1) break;
    if(i>n)
    {
        for(i=0;i<n;i++) a[i]=i+1;
    }
    else
    {
      //  cerr<<i<<" "<<last[i]<<'\n';
        int u=i,pos=last[i];
        a[pos]=i;
        for(i=pos+1;i<n;i++)
        {
            if(u==n) u=1; else u++;
            a[i]=u;
        }
        u=a[pos];
        for(i=pos-1;i>=0;i--)
        {
            if(u==1) u=n; else u--;
            a[i]=u;
        }
    }
    for(i=0;i<n;i++) pos[a[i]]=i;
    set <int> Replace;
    for(i=1;i<=n;i++)
        if(last[i]==-1) Replace.insert(i);
    for(i=n+1;i<=ma;i++)
        if(last[i]==-1)
        {
            int u=*Replace.begin(); Replace.erase(u);
            a[pos[u]]=i; pos[i]=pos[u];
            Replace.insert(i);
            res[m++]=u;
        }
        else
        {
            int u=a[last[i]]; Replace.erase(u);
            a[pos[u]]=i; pos[i]=pos[u];
            res[m++]=u;
        }
    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]<<" ";
    cout<<'\n';
    for(i=0;i<n;i++) cout<<a[i]<<" ";
}
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 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 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 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 12 ms 4188 KB Output is correct
7 Correct 6 ms 2652 KB Output is correct
8 Correct 19 ms 5928 KB Output is correct
9 Correct 6 ms 3420 KB Output is correct
10 Correct 23 ms 6492 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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
6 Correct 11 ms 4340 KB Output is correct
7 Correct 7 ms 2652 KB Output is correct
8 Correct 20 ms 5980 KB Output is correct
9 Correct 6 ms 3416 KB Output is correct
10 Correct 24 ms 6492 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 8 ms 2832 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4696 KB Output is correct
8 Correct 2 ms 4896 KB Output is correct
9 Correct 1 ms 4740 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4696 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4540 KB Output is correct
11 Correct 7 ms 5468 KB Output is correct
12 Correct 8 ms 5496 KB Output is correct
13 Correct 24 ms 6748 KB Output is correct
14 Correct 8 ms 5492 KB Output is correct
15 Correct 38 ms 6700 KB Output is correct

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -