Submission #798669

#	Time	Username	Problem	Language	Result	Execution time	Memory
798669		Liudas	Gondola (IOI14_gondola)	C++17	25 / 100	26 ms	5668 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int valid(int N, int seq[]){
    vector<int> s(2 * N);
    set<int> ss;
    int val = true;
    for(int i = 0; i < N; i ++){
        ss.insert(seq[i]);
        s[i] = seq[i];
        s[i + N] = seq[i];
    }
    if(ss.size()!=N)val = false;
    int start = min_element(s.begin(), s.begin() + N) - s.begin();
    int k = *min_element(s.begin(), s.begin() + N);
    for(int i = start; i < start + N; i ++, k ++){
        if(s[i] <= N && s[i] != k){
            val = false;
        }
    }
    return val;
}
int replacement(int N, int seq[], int rseq[]){
    vector<int> s(2 * N), ss(2 * N);
    vector<pair<int, int>> arr(N);
    for(int i = 0; i < N; i ++){
        s[i] = seq[i];
        s[N+i] = seq[i];
    }
    int k = min_element(s.begin(), s.begin() + N) - s.begin();
    int t = *min_element(s.begin(), s.begin() + N);
    for(int i = k; i < k + N; i ++){
        ss[i] = (t-1)%N+1;
        t++;
    }
    for(int i = k; i < k + N; i ++){
        arr[i-k] = {s[i], ss[i]};
    }
    int p = 0;
    int last = N + 1;
    sort(arr.begin(), arr.end());
    for(int i = 0; i < N; i ++){
        //cout << arr[i].first << " " << arr[i].second << " " << p <<endl;
        if(arr[i].first > N){
            rseq[p++] = arr[i].second;
            for(;last < arr[i].first;){
                rseq[p++] = last++;
            }
        }
    }
    return p;
}
int countReplacement(int N, int seq[]){
    return 0;
}

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:13:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   13 |     if(ss.size()!=N)val = false;
      |        ~~~~~~~~~^~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10