oj.uz

Submission #282429

# Submission time Handle Problem Language Result Execution time Memory
282429 2020-08-24T12:21:36 Z iliccmarko Gondola (IOI14_gondola) C++14
30 / 100
 42 ms 5000 KB 
#include <bits/stdc++.h>
#include<gondola.h>
using namespace std;
#define ll long long
#define endl "\n"

using namespace std;

int next(int n, int tren)
{
    if(tren == n)
        return 1;
    else
        return tren + 1;
}


int valid(int n, int p[])
{
    map<int, int> m;
    m[p[0]]++;
    for(int i = 1;i<n;i++)
    {
        if(m.find(p[i])!=m.end())
            {
                //cout<<i;
                return 0;
            }
        if(p[i]==1&&p[i-1]<n)
            {
                //cout<<i;
                return 0;
            }
        else if(p[i]!=1&&p[i]-1!=p[i-1]&&p[i-1]<=n&&p[i]<=n)
            {
                //cout<<i;
                return 0;
            }
        m[p[i]]++;
    }
    return 1;
}

int replacement(int n, int qs[], int rs[])
{
    int val;
    int ind = -1;;
    for(int i = 0;i<n;i++)
    {
        if(qs[i]<=n)
        {
            ind = i;
            val = qs[i];
            break;
        }
    }
    if(ind == -1)
    {
        for(int i = 0;i<n;i++)
            rs[i] = i + 1;
        return n;
    }
    int ans = 0;
    int i = 0;
    int j = ind;
    vector<int> v;
    vector<int> k;
    while(j<n)
    {
        v.push_back(val);
        k.push_back(qs[j]);
        val = next(n, val);
        j++;
    }
    int poz = v.size();
    j = 0;
    while(j<ind)
    {
        v.push_back(val);
        k.push_back(qs[j]);
        val = next(n, val);
        j++;
    }
    for(int s = 0;s<(int)v.size();s++)
    {
        if(v[s]!=k[s])
        {
            ans++;
        }
    }
    int ppoz = poz;
    while(poz<(int)v.size())
    {
        if(v[poz]!=k[poz])
        {
            rs[i] = v[poz];
            i++;
        }
        poz++;
    }
    int q = 0;
    while(q<(int)v.size()&&q<=ppoz)
    {
        if(v[q]!=k[q])
        {
            rs[i] = v[q];
            i++;
        }
        q++;
    }
    return ans;
}

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 372 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 21 ms 2424 KB Output is correct
7 Correct 14 ms 1152 KB Output is correct
8 Correct 34 ms 4344 KB Output is correct
9 Correct 10 ms 1664 KB Output is correct
10 Correct 42 ms 4984 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 18 ms 2432 KB Output is correct
7 Correct 15 ms 1152 KB Output is correct
8 Correct 36 ms 4388 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 42 ms 5000 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 18 ms 1912 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 21 ms 1144 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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