Submission #56362

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
56362	2018-07-11T07:15:12 Z	WA_TLE	Sorting (IOI15_sorting)	C++14	100 / 100	263 ms	10192 KB

sorting

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
//#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20)
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1e9+7;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
//llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
//やるだけ
#include<sorting.h>
int findSwapPairs(int N,int S[],int M,int X[],int Y[],int P[],int Q[]){
	int bmax=M,bmin=-1,i;
	while(bmax-bmin>1){
		int bgen=(bmax+bmin)/2;
		vector<int>hai(N);
		for(i=0;i<N;i++){hai[i]=S[i];}
		for(i=0;i<bgen;i++){swap(hai[X[i]],hai[Y[i]]);}
		//このswap数を求める
		int now=0;
		for(i=0;i<N;i++){
			while(hai[i]!=i){
				swap(hai[i],hai[hai[i]]);
				now++;
			}
		}
		if(now<=bgen){bmax=bgen;}
		else{bmin=bgen;}
	}
	//bmax回が答え
	//PとQをそろえる
	vector<int>hai(N);
	for(i=0;i<N;i++){hai[i]=S[i];}
	for(i=0;i<bmax;i++){swap(hai[X[i]],hai[Y[i]]);}
	//そろえるやつを番号で指定する
	//とりあえずPとQに格納
	int now=0;
	for(i=0;i<N;i++){
		while(hai[i]!=i){
			P[now]=hai[i];
			Q[now]=i;
			swap(hai[i],hai[hai[i]]);
			now++;
		}
	}
	while(now<bmax){P[now]=0;Q[now]=0;now++;}
	//for(i=0;i<bmax;i++){cerr<<P[i]<<" "<<Q[i]<<endl;}
	vector<int>doco(N);
	for(i=0;i<N;i++){hai[i]=i;doco[i]=i;}
	for(i=bmax-1;i>=0;i--){
		P[i]=doco[P[i]];Q[i]=doco[Q[i]];
		swap(hai[X[i]],hai[Y[i]]);
		swap(doco[hai[X[i]]],doco[hai[Y[i]]]);
	}
	//cerr<<bmax<<endl;
	return bmax;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	3 ms	384 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	3 ms	380 KB	Output is correct
24	Correct	3 ms	384 KB	Output is correct
25	Correct	4 ms	384 KB	Output is correct
26	Correct	4 ms	512 KB	Output is correct
27	Correct	3 ms	412 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct

Subtask #6
26.0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	139 ms	8156 KB	Output is correct
16	Correct	173 ms	8492 KB	Output is correct
17	Correct	263 ms	9300 KB	Output is correct
18	Correct	64 ms	6824 KB	Output is correct
19	Correct	143 ms	7928 KB	Output is correct
20	Correct	143 ms	8296 KB	Output is correct
21	Correct	181 ms	8168 KB	Output is correct
22	Correct	175 ms	8884 KB	Output is correct
23	Correct	177 ms	9196 KB	Output is correct
24	Correct	217 ms	8976 KB	Output is correct
25	Correct	184 ms	9384 KB	Output is correct
26	Correct	133 ms	8292 KB	Output is correct
27	Correct	137 ms	7928 KB	Output is correct
28	Correct	223 ms	9004 KB	Output is correct
29	Correct	196 ms	8988 KB	Output is correct
30	Correct	88 ms	7768 KB	Output is correct
31	Correct	180 ms	9192 KB	Output is correct
32	Correct	195 ms	8908 KB	Output is correct
33	Correct	234 ms	9484 KB	Output is correct
34	Correct	167 ms	9284 KB	Output is correct
35	Correct	140 ms	7816 KB	Output is correct
36	Correct	51 ms	7280 KB	Output is correct
37	Correct	232 ms	10192 KB	Output is correct
38	Correct	222 ms	9384 KB	Output is correct
39	Correct	189 ms	9892 KB	Output is correct

Submission #56362

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 12.0 / 12.0

Subtask #3 16.0 / 16.0

Subtask #4 18.0 / 18.0

Subtask #5 20.0 / 20.0

Subtask #6 26.0 / 26.0

Subtask #1
8.0 / 8.0

Subtask #2
12.0 / 12.0

Subtask #3
16.0 / 16.0

Subtask #4
18.0 / 18.0

Subtask #5
20.0 / 20.0

Subtask #6
26.0 / 26.0