Submission #1521219


Source Code Expand

#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
using namespace std;
typedef long long int llint;
#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
const int mod=1000000007;
const llint big=1e18+10;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-9;
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;}
int main(void){
	int n,m,i,j;cin>>n>>m;
	llint x,a,p;cin>>x>>a>>p;
	llint ans=0;
	vector<tuple<int,int,int>>sek(n*m);//点、元y,元x
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			sek[i*m+j]=mt((int)x,(int)i,j);
			x+=a;x%=p;
		}
	}
	sort(sek.begin(),sek.end());
	for(i=0;i<n;i++){
		vector<int>bas(m);
		for(j=0;j<m;j++){
			bas[j]=get<2>(sek[i*m+j]);
			ans+=abs(get<1>(sek[i*m+j])-i);
		}
		sort(bas.begin(),bas.end());
		for(j=0;j<m;j++){
			ans+=abs(bas[j]-j);
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task C - 席替え
User WA_TLE
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1507 Byte
Status AC
Exec Time 2 ms
Memory 384 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 82
Set Name Test Cases
All case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt, case_16.txt, case_17.txt, case_18.txt, case_19.txt, case_20.txt, case_21.txt, case_22.txt, case_23.txt, case_24.txt, case_25.txt, case_26.txt, case_27.txt, case_28.txt, case_29.txt, case_30.txt, case_31.txt, case_32.txt, case_33.txt, case_34.txt, case_35.txt, case_36.txt, case_37.txt, case_38.txt, case_39.txt, case_40.txt, case_41.txt, case_42.txt, case_43.txt, case_44.txt, case_45.txt, case_46.txt, case_47.txt, case_48.txt, case_49.txt, case_50.txt, case_51.txt, case_52.txt, case_53.txt, case_54.txt, case_55.txt, case_56.txt, case_57.txt, case_58.txt, case_59.txt, case_60.txt, case_61.txt, case_62.txt, case_63.txt, case_64.txt, case_65.txt, case_66.txt, case_67.txt, case_68.txt, case_69.txt, case_70.txt, case_71.txt, case_72.txt, case_73.txt, case_74.txt, case_75.txt, case_76.txt, case_77.txt, case_78.txt, case_79.txt, sample_1.txt, sample_2.txt, sample_3.txt
Case Name Status Exec Time Memory
case_01.txt AC 1 ms 256 KB
case_02.txt AC 1 ms 256 KB
case_03.txt AC 1 ms 256 KB
case_04.txt AC 1 ms 256 KB
case_05.txt AC 1 ms 256 KB
case_06.txt AC 1 ms 256 KB
case_07.txt AC 1 ms 256 KB
case_08.txt AC 1 ms 256 KB
case_09.txt AC 1 ms 256 KB
case_10.txt AC 2 ms 256 KB
case_11.txt AC 1 ms 256 KB
case_12.txt AC 2 ms 256 KB
case_13.txt AC 1 ms 256 KB
case_14.txt AC 1 ms 256 KB
case_15.txt AC 2 ms 384 KB
case_16.txt AC 2 ms 384 KB
case_17.txt AC 1 ms 256 KB
case_18.txt AC 1 ms 256 KB
case_19.txt AC 2 ms 384 KB
case_20.txt AC 1 ms 256 KB
case_21.txt AC 2 ms 256 KB
case_22.txt AC 1 ms 256 KB
case_23.txt AC 2 ms 256 KB
case_24.txt AC 2 ms 256 KB
case_25.txt AC 1 ms 256 KB
case_26.txt AC 2 ms 256 KB
case_27.txt AC 1 ms 256 KB
case_28.txt AC 1 ms 256 KB
case_29.txt AC 1 ms 256 KB
case_30.txt AC 2 ms 256 KB
case_31.txt AC 1 ms 256 KB
case_32.txt AC 1 ms 256 KB
case_33.txt AC 2 ms 256 KB
case_34.txt AC 1 ms 256 KB
case_35.txt AC 1 ms 256 KB
case_36.txt AC 1 ms 256 KB
case_37.txt AC 1 ms 256 KB
case_38.txt AC 1 ms 256 KB
case_39.txt AC 2 ms 384 KB
case_40.txt AC 1 ms 256 KB
case_41.txt AC 1 ms 256 KB
case_42.txt AC 1 ms 256 KB
case_43.txt AC 1 ms 256 KB
case_44.txt AC 1 ms 256 KB
case_45.txt AC 1 ms 256 KB
case_46.txt AC 1 ms 256 KB
case_47.txt AC 2 ms 384 KB
case_48.txt AC 1 ms 256 KB
case_49.txt AC 1 ms 256 KB
case_50.txt AC 2 ms 384 KB
case_51.txt AC 2 ms 384 KB
case_52.txt AC 2 ms 384 KB
case_53.txt AC 2 ms 384 KB
case_54.txt AC 2 ms 384 KB
case_55.txt AC 2 ms 384 KB
case_56.txt AC 2 ms 384 KB
case_57.txt AC 2 ms 384 KB
case_58.txt AC 2 ms 384 KB
case_59.txt AC 2 ms 384 KB
case_60.txt AC 2 ms 384 KB
case_61.txt AC 2 ms 384 KB
case_62.txt AC 2 ms 384 KB
case_63.txt AC 2 ms 384 KB
case_64.txt AC 2 ms 384 KB
case_65.txt AC 2 ms 384 KB
case_66.txt AC 2 ms 384 KB
case_67.txt AC 2 ms 384 KB
case_68.txt AC 2 ms 384 KB
case_69.txt AC 2 ms 384 KB
case_70.txt AC 1 ms 256 KB
case_71.txt AC 1 ms 256 KB
case_72.txt AC 1 ms 256 KB
case_73.txt AC 1 ms 256 KB
case_74.txt AC 1 ms 256 KB
case_75.txt AC 2 ms 384 KB
case_76.txt AC 1 ms 256 KB
case_77.txt AC 1 ms 256 KB
case_78.txt AC 1 ms 256 KB
case_79.txt AC 1 ms 256 KB
sample_1.txt AC 1 ms 256 KB
sample_2.txt AC 1 ms 256 KB
sample_3.txt AC 1 ms 256 KB