oj.uz

Submission #953552

# Submission time Handle Problem Language Result Execution time Memory
953552 2024-03-26T07:21:43 Z irmuun Gondola (IOI14_gondola) C++17
55 / 100
 40 ms 4672 KB 
#include<bits/stdc++.h>
#include "gondola.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int valid(int n, int in[]){
    int mn=n+1,pos=-1;
    map<int,bool>used;
    for(int i=0;i<n;i++){
        if(used[in[i]]){
            return 0;
        }
        used[in[i]]=true;
        if(in[i]<=n){
            if(in[i]<mn){
                mn=in[i];
                pos=i;
            }
        }
    }
    if(pos==-1) return 0;
    for(int i=0;i<n;i++){
        int p=(pos+i)%n;
        if(in[p]<=n){
            if(in[p]!=mn+i) return 0;
        }
    }
    return 1;
}
int replacement(int n, int gon[], int rep[]){
    int mx=0;
    vector<pair<int,int>>v;
    int a[n];
    iota(a,a+n,1);
    int mn=n+1,pos=-1;
    for(int i=0;i<n;i++){
        if(gon[i]<=n){
            if(gon[i]<mn){
                mn=gon[i];
                pos=i;
            }
        }
    }
    if(pos>-1){
        for(int i=0;i<n;i++){
            a[(i+pos)%n]=mn;
            mn=mn+1;
            if(mn>n) mn=1;
        }
    }
    for(int i=0;i<n;i++){
        if(gon[i]>n){
            v.pb({gon[i],i});
        }
    }
    sort(all(v));
    for(int i=0;i<v.size();i++){
    }
    int l=n+1,cur=0;
    for(int i=0;i<v.size();i++){
        int bef=a[v[i].ss];
        for(;l<=v[i].ff;l++){
            rep[cur++]=bef;
            bef=l;
        }
    }
    return cur;
}
int countReplacement(int n, int in[]){
    return 0;
}

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:64:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~
gondola.cpp:67:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~
gondola.cpp:38:9: warning: unused variable 'mx' [-Wunused-variable]
   38 |     int mx=0;
      |         ^~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 10 ms 2140 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 24 ms 4000 KB Output is correct
9 Correct 6 ms 1428 KB Output is correct
10 Correct 24 ms 4552 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 12 ms 2140 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 19 ms 3972 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 23 ms 4444 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 13 ms 2140 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 40 ms 4672 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1480 KB Output is correct
12 Correct 7 ms 1628 KB Output is correct
13 Correct 10 ms 1516 KB Output is correct
14 Correct 6 ms 1368 KB Output is correct
15 Correct 15 ms 2388 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -