oj.uz

Submission #204864

# Submission time Handle Problem Language Result Execution time Memory
204864 2020-02-27T11:26:10 Z awlintqaa Gondola (IOI14_gondola) C++14
60 / 100
 30 ms 2676 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "gondola.h"
int z=0;
int done[100009];
int valid(int N, int a[]){
        int n=N;
        int st=-1,mn=1e9;vi ret;
        for(int i=0;i<n;i++){
                if(a[i]<=n && a[i]<mn){
                        mn=a[i];
                        st=i;
                }
                else if(a[i]>n)ret.pb(a[i]);
        }
        sort(ret.begin(),ret.end());
  		if(!z){
        	for(int i=1;i<ret.size();i++){
        	        if(ret[i]!=ret[i-1]+1)return 0;
        	}
        }
        if(st==-1)return 1;
        int goal=a[st];
        while(!done[st]){
                if(a[st]<=n && a[st]!=goal)return 0;
                done[st]=1;
                st++;
                goal++;
                st%=n;
                if(goal>n)goal=1;
        }
        return 1;
}
 
//----------------------
 
int replacement(int n, int a[], int replacementSeq[]){
  		z=1;
        if(!valid(n,a))while(1){}
        int st=0,mn=1e9;
        for(int i=0;i<n;i++){
                if(a[i]<=n && mn>a[i])mn=a[i],st=i;
        }mem(done,0);
        int goal=1;if(a[st]<=n)goal=a[st];
        vpi ret;vi ans;
        while(!done[st]){
                if(a[st]>n)ret.pb({a[st],goal});
                done[st]=1;
                st++,goal++;
                st%=n;if(goal>n)goal=1;
        }sort(ret.begin(),ret.end());
        int last=n;
        for(auto u:ret){
                while(u.se!=u.fi){
                        ans.pb(u.se);
                        if(u.se<=n)u.se=last+1;
                        else u.se++;
                }
                last=u.fi;
        }
        for(int i=0;i<ans.size();i++)replacementSeq[i]=ans[i];
        return (int)ans.size();
}
//----------------------
 
int countReplacement(int n, int inputSeq[]){
  z=1;
  if(!valid(n,inputSeq))return 0;
  return 1;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:44:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
          for(int i=1;i<ret.size();i++){
                      ~^~~~~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:87:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<ans.size();i++)replacementSeq[i]=ans[i];
                     ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 372 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 17 ms 632 KB Output is correct
8 Correct 14 ms 888 KB Output is correct
9 Correct 8 ms 504 KB Output is correct
10 Correct 16 ms 1016 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 10 ms 636 KB Output is correct
7 Correct 17 ms 632 KB Output is correct
8 Correct 14 ms 888 KB Output is correct
9 Correct 8 ms 504 KB Output is correct
10 Correct 15 ms 1016 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 16 ms 888 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 19 ms 888 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 764 KB Output is correct
2 Correct 6 ms 760 KB Output is correct
3 Correct 6 ms 760 KB Output is correct
4 Correct 5 ms 760 KB Output is correct
5 Correct 5 ms 760 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 760 KB Output is correct
2 Correct 5 ms 760 KB Output is correct
3 Correct 5 ms 760 KB Output is correct
4 Correct 5 ms 760 KB Output is correct
5 Correct 5 ms 760 KB Output is correct
6 Correct 5 ms 760 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 6 ms 760 KB Output is correct
9 Correct 5 ms 760 KB Output is correct
10 Correct 6 ms 760 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 760 KB Output is correct
2 Correct 5 ms 760 KB Output is correct
3 Correct 7 ms 760 KB Output is correct
4 Correct 5 ms 760 KB Output is correct
5 Correct 5 ms 760 KB Output is correct
6 Correct 5 ms 764 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 760 KB Output is correct
9 Correct 5 ms 760 KB Output is correct
10 Correct 5 ms 888 KB Output is correct
11 Correct 16 ms 1016 KB Output is correct
12 Correct 17 ms 1144 KB Output is correct
13 Correct 24 ms 1772 KB Output is correct
14 Correct 16 ms 1016 KB Output is correct
15 Correct 30 ms 2676 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 380 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 372 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

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