oj.uz

답안 #210831

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
210831 2020-03-18T18:48:39 Z tleontest1 학생 (COCI14_studentsko) C++14
0 / 100
 1000 ms 1016 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
map<int,int> mpp,vis;
vector<int> v;

int main(void){
	scanf("%d %d",&n,&m);
	FOR{
		scanf("%d",&a[i]);
		b[i]=a[i];
	}
	sort(b+1,b+n+1);
	FOR{
		mpp[b[i]]=(i-1)/m+1;
	}
	//~ int say=0;
	for(int i=1;i<=n/m;i++){
		for(int j=1;j<=n;j++){
			if(mpp[a[j]]==i){v.pb(a[j]);}
		}
	}
	FOR{
		b[i]=a[i];
		vis[a[i]]=i;
	}
	for(int i=1;i<=n;i++){
		int bas=vis[v[i-1]];
		flag=0;
		for(int j=bas;j>i;j--){
			vis[b[j-1]]=j;
			vis[b[j]]=j-1;
			swap(b[j],b[j-1]);
			flag=1;
		}
		for(int j=bas;j<i;j++){
			vis[b[j+1]]=j;
			vis[b[j]]=j+1;
			swap(b[j],b[j+1]);
			flag=1;
		}
		if(flag)
		cev++;
	}
	int mn=cev;
	cev=0;
	FOR{
		b[i]=a[i];
		vis[a[i]]=i;
	}
	for(int i=n;i>=1;i--){
		flag=0;
		int bas=vis[v[i-1]];
		for(int j=bas;j>i;j--){
			vis[b[j-1]]=j;
			vis[b[j]]=j-1;
			swap(b[j],b[j-1]);
			flag=1;
		}
		for(int j=bas;j<i;j++){
			vis[b[j+1]]=j;
			vis[b[j]]=j+1;
			swap(b[j],b[j+1]);
			flag=1;
		}
		if(flag)
		cev++;
	}
	printf("%d\n",min(mn,cev));
	return 0;
}

Compilation message

studentsko.cpp: In function 'int main()':
studentsko.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
studentsko.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
   ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 420 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1004 ms 892 KB Time limit exceeded

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1038 ms 888 KB Time limit exceeded

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1024 ms 760 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1033 ms 1016 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1038 ms 784 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1070 ms 888 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1045 ms 820 KB Time limit exceeded
2 Halted 0 ms 0 KB -