oj.uz

Submission #787737

# Submission time Handle Problem Language Result Execution time Memory
787737 2023-07-19T11:55:03 Z tolbi Gondola (IOI14_gondola) C++17
55 / 100
 32 ms 4692 KB 
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> ostream& operator<<(ostream& os, vector<X> v){for (auto &it : v) os<<it<<" ";return os;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> v){for (auto &it : v) os<<it<<" ";return os;}
ostream& operator<<(ostream& os, bool bl){return os<<(int32_t)bl;}
#define endl '\n'
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for(auto &it : x) cin>>it;
#define coutarr(x) for(auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define tol(bi) (1ll<<((int)(bi)))
typedef long long ll;
const ll INF = LONG_LONG_MAX;
const ll MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());

#include "gondola.h"

int valid(int n, int inputSeq[])
{
	map<int,bool> mp;
	int pos = -1;
	for (int i = 0; i < n; ++i)
	{
		if (mp[inputSeq[i]]) return 0;
		mp[inputSeq[i]]=true;
	}
	for (int i = 0; i < n; ++i)
	{
		if (inputSeq[i]<=n){
			pos=i;
			break;
		}
	}
	if (pos==-1) return 1;
	pos-=inputSeq[pos]-1;
	if (pos<0) pos+=n;
	for (int i = 0; i < n; i++){
		int pp = (pos+i)%n;
		if (inputSeq[pp]>n) continue;
		if (inputSeq[pp]!=i+1) return 0;
	}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	vector<int> arr(n);
	int start = 0;
	vector<pair<int,int>> gerek;
	for (int i = 0; i < n; ++i)
	{
		if (gondolaSeq[i]<=n) continue;
		gerek.push_back({gondolaSeq[i],i});
	}
	for (int i = 0; i < n; i++){
		if (gondolaSeq[i]<=n){
			start=i-gondolaSeq[i]+1;
			break;
		}
	}
	if (start<n) start+=n;
	for (int i = 0; i < n; i++){
		int ppos = (start+i)%n;
		arr[ppos]=i+1;
	}
	int crr = n+1;
	int res = 0;
	sortarr(gerek);
	for (int i = 0; i < gerek.size(); ++i)
	{
		int hedef = gerek[i].first;
		int node = gerek[i].second;
		while (arr[node]<hedef){
			replacementSeq[res]=arr[node];
			arr[node]=crr;
			crr++,res++;
		}
	}
	return res;
}

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

int countReplacement(int n, int inputSeq[])
{
	if (!valid(n,inputSeq)) return 0;
	vector<int> kk;
	kk.push_back(n);
	bool boolean=true;
	for (int i = 0; i < n; i++){
		if (inputSeq[i]>n) kk.push_back(inputSeq[i]);
		else boolean=false;
	}
	sortarr(kk);
	ll ans = 1;
	if (boolean) ans=n;
	for (int i = 1; i < kk.size(); i++){
		ll arada = kk[i]-kk[i-1];
		ll val = kk.size()-i;
		for (int i = 0; i < arada; ++i)
		{
			ans*=val;
			ans%=MOD;
		}
	}
	return ans;
}

Compilation message

gondola.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:87:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |  for (int i = 0; i < gerek.size(); ++i)
      |                  ~~^~~~~~~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:115:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |  for (int i = 1; i < kk.size(); i++){
      |                  ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 312 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 2132 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 22 ms 3924 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 23 ms 4440 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 2132 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 20 ms 3876 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 23 ms 4540 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 13 ms 1984 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 32 ms 4692 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 7 ms 980 KB Output is correct
13 Correct 12 ms 1240 KB Output is correct
14 Correct 6 ms 852 KB Output is correct
15 Correct 16 ms 2208 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -