oj.uz

Submission #974250

# Submission time Handle Problem Language Result Execution time Memory
974250 2024-05-03T06:49:17 Z rahidilbayramli Gondola (IOI14_gondola) C++17
25 / 100
 25 ms 5456 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int valid(int n, int inputSeq[])
{
    int nxt[n+5], v[n+5];
    set<int>st;
    for(int i = 1; i <= n; i++)
    {
        v[i] = inputSeq[i-1];
        st.insert(v[i]);
    }
    for(int i = 1; i <= n; i++)
        nxt[i] = (i % n) + 1;
    bool flag = false;
    for(int i = 1; i <= n; i++)
    {
        if(v[i] <= n && v[(i%n)+1] <= n && nxt[v[i]] != v[(i%n)+1])
            flag = true;
    }
    if(flag || st.size() < n)
        return 0;
    return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int v[n+5], maxx = 0, idx = 0, sz = 250005;
    int x[sz+5];
    for(int i = 1; i <= sz; i++)
        x[i] = 0;
    for(int i = 1; i <= n; i++)
    {
        v[i] = gondolaSeq[i-1];
        x[v[i]] = 1;
        maxx = max(maxx, v[i]);
    }
    for(int i = 1; i <= maxx; i++)
    {
        if(x[i] == 0)
        {
            replacementSeq[idx] = i;
            idx++;
        }
    }
    return idx;
}

//----------------------

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:36:26: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(flag || st.size() < n)
      |                ~~~~~~~~~~^~~

Subtask #1
5.0 / 5.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

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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 8 ms 2528 KB Output is correct
7 Correct 21 ms 4332 KB Output is correct
8 Correct 15 ms 4444 KB Output is correct
9 Correct 5 ms 1628 KB Output is correct
10 Correct 19 ms 5212 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 1 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 8 ms 2396 KB Output is correct
7 Correct 21 ms 4444 KB Output is correct
8 Correct 15 ms 4484 KB Output is correct
9 Correct 5 ms 1628 KB Output is correct
10 Correct 19 ms 5280 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 10 ms 2252 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 25 ms 5456 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1368 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -