oj.uz

Submission #243795

# Submission time Handle Problem Language Result Execution time Memory
243795 2020-07-01T19:23:38 Z aloo123 Gondola (IOI14_gondola) C++14
20 / 100
 39 ms 5112 KB 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <gondola.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
// #define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> os;
 
 
const ll INF = 1e18;
const ll N =(1e5+5); // TODO : change value as per problem
const ll MOD = 1e9+7;


int valid(int n, int a[]){
    bool done[n+1];
    ll spare = n+1;
    set<ll> se;
    ll nxt = a[0];
    se.in(nxt);
    nxt++;
    if(nxt > n) nxt = 1;
    // ll spare =n;
    for(int i = 1;i<n;i++){
        if(se.find(a[i]) != se.end()) return 0;
        if(a[i] <= n){
            if(a[i] != nxt) return 0;
            se.in(a[i]);
        }
        else{
            if(a[i] < spare){
                return 0;           
            }
            spare = a[i];
        }
        nxt++;
        if(nxt > n) nxt = 1;
    }
    return 1;
}
int replacement(int n, int a[], int replacementSeq[]) {
    ll idx = -1;
    for(int i =0;i<n;i++){
        if(a[i] <= n){
            idx =i;
            break;
        }
    }

    int b[n];
    for(int i =0;i<n;i++){
        if(a[i] <= n){
            b[i] = a[i];
        }
    }
    vector<int> ans;
    // vector<pair<int,int>> ans;
    ll count = 1;
    ll nxt = a[idx];
    nxt++;
    if(nxt > n) nxt = 1;
    idx++;
    if(idx > n) idx = 1;
    while(count < n){
        if(a[idx] <= n){
            count++;
            idx++;
            if(idx > n) idx = 1;
            nxt++;
            if(nxt > n) nxt = 1;
        }
        else{
            b[idx] = nxt;
            nxt++;
            idx++;
            if(nxt > n) nxt = 1;
            if(idx > n) idx = 1;
            count++;
        }
    }
    ll sp = n+1;
    // for(int i =0;i<n;i++) cout << b[i] << " ";cout<<endl;
    for(int i =0;i<n;i++){
        if(b[i] == a[i]) continue;
        ans.pb(b[i]);
        ll x = sp;
        while(x != a[i]){
            ans.pb(x);
            x++;
        }
        sp = x+1;
    }
    // for(int i = 0;i<sz(ans);i++) cout<<ans[i]<<" ";cout<<endl;
    for(int i = 0;i<sz(ans);i++) replacementSeq[i] = ans[i];
    return sz(ans);

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

// int main(){
//     int n;
//     cin >> n;
//     int a[n];
//     int x[100000];
//     for(int i =0;i<n;i++)cin >> a[i];
//     cout << replacement(n,a,x) << endl;
// }

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:60:10: warning: unused variable 'done' [-Wunused-variable]
     bool done[n+1];
          ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 19 ms 2432 KB Output is correct
7 Correct 16 ms 1152 KB Output is correct
8 Correct 31 ms 4352 KB Output is correct
9 Correct 12 ms 1664 KB Output is correct
10 Correct 38 ms 4984 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 10 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 19 ms 2432 KB Output is correct
7 Correct 16 ms 1152 KB Output is correct
8 Correct 32 ms 4344 KB Output is correct
9 Correct 12 ms 1664 KB Output is correct
10 Correct 39 ms 5112 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 10 ms 672 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 17 ms 1152 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Integer 0 violates the range [1, 2]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Integer 0 violates the range [1, 2]
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Integer 0 violates the range [1, 2]
3 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 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 5 ms 384 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 5 ms 384 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 5 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -