oj.uz

Submission #1017718

# Submission time Handle Problem Language Result Execution time Memory
1017718 2024-07-09T09:38:09 Z serkanrashid Gondola (IOI14_gondola) C++14
55 / 100
 18 ms 5808 KB 
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+5;

int n,a[maxn];

bool check_valid()
{
    unordered_set<int>used;
    int st = -1;

    for(int i = 0; i < n; i++)
    {
        if(used.find(a[i])!=used.end()) return false;
        used.insert(a[i]);
        if(1<=a[i] && a[i] <= n) st = i;
    }
    if(st==-1) return true;

    int last = a[st];
    int i = (st+1)%n;

    while(i!=st)
    {
        last++;
        if(last>n) last = 1;
        if(1<=a[i] && a[i]<=n)
        {
            if(last!=a[i]) return false;
        }
        i = (i+1)%n;
    }
    return true;
}

int valid(int N, int inputSeq[])
{
    n = N;
    for(int i = 0; i < n; i++) a[i] = inputSeq[i];
    return check_valid();
}

int need[maxn];

void make_need()
{
    int st = -1;
    for(int i = 0; i < n; i++) if(1 <= a[i] && a[i] <= n) st = i;

    if(st==-1)
    {
        for(int i = 0; i < n; i++) need[i] = i+1;
        return;
    }
    int last = a[st];
    int i = (st+1)%n;
    while(i!=st)
    {
        last++;
        if(last>n) last = 1;
        need[i] = last;
        i = (i+1)%n;
    }
}

vector<int> do_replace()
{
    int l = 0;
    for(int i = 0; i < n; i++) if(a[i]>l) l = a[i];
    l = l - n;

    vector<pair<int,int> >pos;
    for(int i = 0; i < n; i++) if(a[i]>n) pos.push_back({a[i],need[i]});
    sort(pos.begin(),pos.end());

    vector<int>res;

    int last = n;
    for(pair<int,int> nb : pos)
    {
        res.push_back(nb.second);
        for(int j = last+1; j < nb.first; j++) res.push_back(j);
        last = nb.first;
    }
    return res;
}

int replacement(int N, int gondolaSeq[], int replacementSeq[])
{
    n = N;
    for(int i = 0; i < n; i++) a[i] = gondolaSeq[i];
    make_need();
    vector<int>pom = do_replace();
    for(int i = 0; i < pom.size(); i++) replacementSeq[i] = pom[i];
    return pom.size();
}

int countReplacement(int N, int inputSeq[])
{
    n = N;
    for(int i = 0; i < n; i++) a[i] = inputSeq[i];
    if(!check_valid()) return 0;
    ///OSHTE


}

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:97:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |     for(int i = 0; i < pom.size(); i++) replacementSeq[i] = pom[i];
      |                    ~~^~~~~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:109:1: warning: control reaches end of non-void function [-Wreturn-type]
  109 | }
      | ^

Subtask #1
5.0 / 5.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 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #2
5.0 / 5.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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 5 ms 2020 KB Output is correct
7 Correct 7 ms 1116 KB Output is correct
8 Correct 16 ms 3872 KB Output is correct
9 Correct 5 ms 1624 KB Output is correct
10 Correct 18 ms 4204 KB Output is correct

Subtask #3
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 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 2196 KB Output is correct
7 Correct 11 ms 1124 KB Output is correct
8 Correct 11 ms 3688 KB Output is correct
9 Correct 3 ms 1628 KB Output is correct
10 Correct 12 ms 4148 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 7 ms 1972 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 14 ms 5808 KB Output is correct

Subtask #4
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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 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 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 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 10 ms 1216 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 10 ms 1628 KB Output is correct
14 Correct 5 ms 1368 KB Output is correct
15 Correct 18 ms 2360 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 348 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 -