# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
584756 | jack715 | Gondola (IOI14_gondola) | C++14 | 18 ms | 2304 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "gondola.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define bb back
#define ff first
#define ss second
using namespace std;
void rotatek(vector<int>& nums, int k) {
vector<int> cp = nums;
int n = nums.size();
for (int i = 0; i < n; i++)
nums[i] = cp[(i+k)%n];
}
int valid(int n, int inputSeq[])
{
vector<int> nums(n);
for (int i = 0; i < n; i++) nums[i] = inputSeq[i];
for (int i = 0; i < n; i++) {
if (nums[i] <= n) {
rotatek(nums, (i-nums[i]+1+n)%n);
break;
}
}
vector<int> rem;
for (int i = 0; i < n; i++) {
if (nums[i] <= n && nums[i] != i+1) return 0;
if (nums[i] > n) rem.pb(nums[i]);
}
sort(rem.begin(), rem.end());
for (int i = 1; i < rem.size(); i++) {
if (rem[i] != rem[i-1]+1) return 0;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
vector<int> nums(n);
vector<pair<int, int> > rem;
for (int i = 0; i < n; i++)
nums[i] = gondolaSeq[i];
for (int i = 0; i < n; i++) {
if (nums[i] <= n) {
rotatek(nums, (i-nums[i]+1+n)%n);
break;
}
}
for (int i = 0; i < n; i++) {
if (nums[i] > n) {
rem.pb({nums[i], i+1});
}
}
sort(rem.begin(), rem.end());
int now, next = n+1, ans = 0;
for (int i = 0; i < rem.size(); i++) {
now = rem[i].ss;
while (now < rem[i].ff) {
replacementSeq[ans] = now;
now = next, next++;
ans++;
}
}
return ans;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |