oj.uz

Submission #278248

# Submission time Handle Problem Language Result Execution time Memory
278248 2020-08-21T11:26:51 Z shinjan Gondola (IOI14_gondola) C++14
60 / 100
 26 ms 2288 KB 
#include <iostream>
#include <bits/stdc++.h>
#define mod 1000000009
#include "gondola.h"
using namespace std;
set<int> gond;
set<int> pok;
int step(int a,int b)
{
    if(b==0)
        return 1;
    if(b%2==0)
        return (step(a,b/2)%mod)*(step(a,b/2)%mod);
    return (step(a,b/2)%mod)*(step(a,b/2)%mod)*(a%mod);
}
int valid(int n,int seq[])
{
    int prvi=-1;
    for(int i=0;i<n;i++)
    {
        if(seq[i]<=n)
        {
            prvi=i;
            break;
        }
    }
    if(prvi==-1)
    {
        for(int i=0;i<n;i++)
        {
            if(gond.find(seq[i])!=gond.end())
            {
                return 0;
            }
            gond.insert(seq[i]);
        }
        return 1;
    }
    int tren=seq[prvi];
    for(int i=prvi+1;i<n;i++)
    {
        if(tren==n)
        {
            if(seq[i]!=1)
            {
                if(seq[i]<=n)
                {
                    return 0;
                }
                if(gond.find(seq[i])!=gond.end())
                {
                    return 0;
                }
                gond.insert(seq[i]);
            }
            tren=1;
        }
        else if(seq[i]!=tren+1)
        {
            if(seq[i]<=n)
            {
                return 0;
            }
            if(gond.find(seq[i])!=gond.end())
            {
                return 0;
            }
            gond.insert(seq[i]);
            tren=tren+1;
        }
        else{
            tren=tren+1;
        }
    }
    for(int i=0;i<=prvi;i++)
    {
        if(tren==n)
        {
            if(seq[i]!=1)
            {
                if(seq[i]<=n)
                {
                    return 0;
                }
                if(gond.find(seq[i])!=gond.end())
                {
                    return 0;
                }
                gond.insert(seq[i]);
            }
            tren=1;
        }
        else if(seq[i]!=tren+1)
        {
            if(seq[i]<=n)
            {
                return 0;
            }
            if(gond.find(seq[i])!=gond.end())
            {
                return 0;
            }
            gond.insert(seq[i]);
            tren=tren+1;
        }
        else{
            tren=tren+1;
        }
    }
    return 1;
}
int replacement(int n, int gondola[], int promena[])
{
    int prvi=-1;
    vector <pair<int,int>> v;
    for(int i=0;i<n;i++)
    {
        if(gondola[i]<=n)
        {
            prvi=i;
            break;
        }
    }
    if(prvi==-1)
    {
        for(int i=0;i<n;i++)
        {
            v.push_back({gondola[i],i+1});
        }
        sort(v.begin(),v.end());
        int tren=n+1;
        int poz=0;
        for(int i=0;i<v.size();i++)
        {
            promena[poz]=v[i].second;
            poz++;
            while(tren!=v[i].first)
            {
                promena[poz]=tren;
                poz++;
                tren++;
            }
            tren++;
        }
        return poz;
    }
    int next;
    if(gondola[prvi]==n)
    {
        next=1;
    }
    else{
        next=gondola[prvi]+1;
    }
    for(int i=prvi+1;i<n;i++)
    {
        if(gondola[i]!=next)
        {
            v.push_back({gondola[i],next});
        }
        if(next==n)
        {
            next=1;
        }
        else{
            next++;
        }
    }
    for(int i=0;i<prvi;i++)
    {
        if(gondola[i]!=next)
        {
            v.push_back({gondola[i],next});
        }
        if(next==n)
        {
            next=1;
        }
        else{
            next++;
        }
    }
    sort(v.begin(),v.end());
    int tren=n+1;
    int poz=0;
    for(int i=0;i<v.size();i++)
    {
        promena[poz]=v[i].second;
        poz++;
        while(tren!=v[i].first)
        {
            promena[poz]=tren;
            poz++;
            tren++;
        }
        tren++;
    }
    return poz;
}
int countReplacement(int n, int seq[])
{
    if(!valid(n,seq))
        return 0;
    int brpok=0;
    int maks=0;
    for(int i=0;i<n;i++)
    {
        if(seq[i]>n)
        {
            brpok++;
            pok.insert(seq[i]);
        }
        maks=max(maks,seq[i]);
    }
    if(brpok==0)
        return 1;
    int stepen=0;
    int ans=1;
    for(int i=n+1;i<=maks;i++)
    {
        if(pok.find(i)!=pok.end())
        {
            ans=(ans*step(brpok,stepen)%mod);
            brpok--;
            stepen=0;
        }
        else{
            stepen++;
        }
    }
    return ans;
}

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:133:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |         for(int i=0;i<v.size();i++)
      |                     ~^~~~~~~~~
gondola.cpp:186: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]
  186 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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 0 ms 256 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 21 ms 640 KB Output is correct
8 Correct 9 ms 640 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 10 ms 640 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 12 ms 640 KB Output is correct
8 Correct 9 ms 640 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 12 ms 640 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 1 ms 276 KB Output is correct
15 Correct 16 ms 640 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 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct

Subtask #5
10.0 / 10.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 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 13 ms 640 KB Output is correct
12 Correct 20 ms 640 KB Output is correct
13 Correct 17 ms 1296 KB Output is correct
14 Correct 10 ms 640 KB Output is correct
15 Correct 26 ms 2288 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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
6 Correct 1 ms 256 KB Output is correct
7 Incorrect 1 ms 384 KB Integer -130349311 violates the range [0, 1000000008]
8 Halted 0 ms 0 KB -

Subtask #9
0 / 15.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 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB Integer -130349311 violates the range [0, 1000000008]
8 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB Integer -130349311 violates the range [0, 1000000008]
8 Halted 0 ms 0 KB -