oj.uz

답안 #921445

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921445 2024-02-03T21:18:44 Z Nika533 곤돌라 (IOI14_gondola) C++17
60 / 100
 28 ms 4692 KB 
#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#include "gondola.h"
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;
int n,m,T,k;

int valid(int n, int inputSeq[])
{
	int ind=-1;
	map<int,int> mymap;
	for (int i=0; i<n; i++) {
		mymap[inputSeq[i]]++;
		if (inputSeq[i]<=n) ind=i;
	}
	for (auto x:mymap) {
		if (x.s>1) return 0;
	}
	if (ind==-1) return 1;
	for (int i=ind+1; i<n+ind; i++) {
		if (inputSeq[(i%n)]>n) {
			inputSeq[(i%n)]=inputSeq[((i-1)%n)]+1;
			//if (inputSeq[(i%n)]==n+1) inputSeq[(i%n)]=1;
		}
	}
	int cnt=0;
	for (int i=1; i<n; i++) {
		if (inputSeq[i]<inputSeq[i-1]) cnt++;
		if (inputSeq[i]>n) return 0;
	}
	return (cnt<=1);
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int mx=0;
	vector<pii> v;
	int j=0,diff=0;
	for (int i=0; i<n; i++) {
		if (gondolaSeq[i]<=n) {
			diff=(i+n-gondolaSeq[i])%n;
		}
	}
	for (int i=0; i<n; i++) {
		int val;
		if (diff>=i) val=diff-i;
		else val=diff+n-i;
		val=n-val;
		if (gondolaSeq[i]>n) v.pb({gondolaSeq[i],val});
	}
	int ind=0,cur=n+1;
	sort(all(v));
	for (int j=0; j<v.size(); j++) {
		replacementSeq[ind]=v[j].s; ind++;
		for (int o=cur; o<v[j].f; o++) {
			replacementSeq[ind]=o; ind++;
		}
		cur=v[j].f+1;
	} 
	return ind;
}

int countReplacement(int n, int inputSeq[])
{
	int arr[n];
	for (int i=0; i<n; i++) arr[i]=inputSeq[i];
  if (!valid(n,arr)) return 0;
  int mx=0,mn=1e9;
	vector<int> v;
  for (int i=0; i<n; i++) {
  		mx=max(mx,inputSeq[i]);
  		mn=min(mn,inputSeq[i]);
		if (inputSeq[i]>n) {
			v.pb(inputSeq[i]);
		}
  }
  int ans=1;
  if (mn>n) {
  	ans=n;
  }
  int cur=n,val=v.size();
  sort(all(v));
  for (int j=0; j<v.size(); j++) {
  		for (int i=cur+1; i<v[j]; i++) {
  			ans*=val;
  			ans%=MOD;
		}
  		cur=v[j]; val--;
  }
  return ans;
}

Compilation message

gondola.cpp:1:32: warning: '-std=c++11' is not an option that controls warnings [-Wpragmas]
    1 | #pragma GCC diagnostic warning "-std=c++11"
      |                                ^~~~~~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:60:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |  for (int j=0; j<v.size(); j++) {
      |                ~^~~~~~~~~
gondola.cpp:43:6: warning: unused variable 'mx' [-Wunused-variable]
   43 |  int mx=0;
      |      ^~
gondola.cpp:45:6: warning: unused variable 'j' [-Wunused-variable]
   45 |  int j=0,diff=0;
      |      ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:90:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |   for (int j=0; j<v.size(); j++) {
      |                 ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 8 ms 2140 KB Output is correct
7 Correct 20 ms 3648 KB Output is correct
8 Correct 15 ms 3940 KB Output is correct
9 Correct 5 ms 1520 KB Output is correct
10 Correct 18 ms 4444 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 8 ms 2356 KB Output is correct
7 Correct 20 ms 3804 KB Output is correct
8 Correct 15 ms 3904 KB Output is correct
9 Correct 5 ms 1488 KB Output is correct
10 Correct 18 ms 4444 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 12 ms 2136 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 28 ms 4692 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 7 ms 600 KB Output is correct
12 Correct 7 ms 604 KB Output is correct
13 Correct 10 ms 1260 KB Output is correct
14 Correct 7 ms 600 KB Output is correct
15 Correct 15 ms 2384 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 600 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 544 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -