Submission #1672772
Source Code Expand
#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" // define macro "/D__MAI" using namespace std; typedef long long int ll; #define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__) #define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;} #define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;} #define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}} #define ALL(v) (v).begin(),(v).end() #define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt)) #define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt)) #define MD 1000000007ll #define PI 3.1415926535897932384626433832795 #define EPS 1e-12 template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; } template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); } template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); } template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); } template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); } mt19937_64 randdev(8901016); inline ll rand_range(ll l, ll h) { return uniform_int_distribution<ll>(l, h)(randdev); } #ifdef __MAI #define getchar_unlocked getchar #define putchar_unlocked putchar #endif #ifdef __VSCC #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #endif namespace { #define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E) class MaiScanner { public: template<typename T> void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'<cc; cc = getchar_unlocked()) if (cc == '-') sign = -1; for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked()) var = (var << 3) + (var << 1) + cc - '0'; var = var*sign; } inline int c() { return getchar_unlocked(); } inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getchar_unlocked(); for (; !isvisiblechar(cc); cc = getchar_unlocked()); for (; isvisiblechar(cc); cc = getchar_unlocked()) var.push_back(cc); return *this; } template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; } MaiScanner scanner; ll m, n, kei; ll randx, randa, randp; ll field[1010][1010]; int main() { scanner >> n >> m; scanner >> randx >> randa >> randp; map<ll, array<ll,3>> sorted; repeat(y,n){ repeat(x, m) { field[y][x] = randx; sorted[randx] = { y,x,0 }; randx = (randx + randa) % randp; } } //debugaa(field, n, m); ll ans = 0; auto itr = sorted.begin(); vector<ll> cnt(m); repeat(y, n) { fill(ALL(cnt), 0ll); repeat(x, m) { auto& a = itr->second; ans += abs(y - a[0]); cnt[a[1]] += 1; ++itr; } ll lft = 0; repeat(x, m) { lft += cnt[x] - 1; ans += abs(lft); } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 席替え |
User | m_buyoh |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 3903 Byte |
Status | WA |
Exec Time | 4 ms |
Memory | 1536 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
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 | 2 ms | 512 KB |
case_02.txt | AC | 2 ms | 768 KB |
case_03.txt | AC | 2 ms | 640 KB |
case_04.txt | AC | 1 ms | 384 KB |
case_05.txt | AC | 2 ms | 768 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 | 2 ms | 768 KB |
case_10.txt | AC | 2 ms | 896 KB |
case_11.txt | AC | 2 ms | 512 KB |
case_12.txt | AC | 3 ms | 1024 KB |
case_13.txt | AC | 1 ms | 256 KB |
case_14.txt | AC | 2 ms | 640 KB |
case_15.txt | AC | 3 ms | 1152 KB |
case_16.txt | AC | 3 ms | 1152 KB |
case_17.txt | AC | 2 ms | 768 KB |
case_18.txt | AC | 2 ms | 896 KB |
case_19.txt | AC | 4 ms | 1536 KB |
case_20.txt | AC | 2 ms | 768 KB |
case_21.txt | AC | 3 ms | 1024 KB |
case_22.txt | AC | 1 ms | 384 KB |
case_23.txt | AC | 3 ms | 1152 KB |
case_24.txt | AC | 2 ms | 1024 KB |
case_25.txt | AC | 2 ms | 512 KB |
case_26.txt | AC | 2 ms | 896 KB |
case_27.txt | AC | 2 ms | 896 KB |
case_28.txt | AC | 1 ms | 256 KB |
case_29.txt | AC | 2 ms | 896 KB |
case_30.txt | AC | 3 ms | 1024 KB |
case_31.txt | AC | 1 ms | 384 KB |
case_32.txt | AC | 1 ms | 384 KB |
case_33.txt | AC | 2 ms | 896 KB |
case_34.txt | AC | 2 ms | 1024 KB |
case_35.txt | AC | 2 ms | 512 KB |
case_36.txt | AC | 2 ms | 640 KB |
case_37.txt | AC | 1 ms | 256 KB |
case_38.txt | AC | 1 ms | 384 KB |
case_39.txt | AC | 3 ms | 1152 KB |
case_40.txt | AC | 2 ms | 768 KB |
case_41.txt | AC | 2 ms | 512 KB |
case_42.txt | AC | 1 ms | 384 KB |
case_43.txt | AC | 2 ms | 640 KB |
case_44.txt | AC | 1 ms | 256 KB |
case_45.txt | AC | 2 ms | 768 KB |
case_46.txt | AC | 2 ms | 768 KB |
case_47.txt | AC | 3 ms | 1280 KB |
case_48.txt | AC | 1 ms | 384 KB |
case_49.txt | AC | 1 ms | 256 KB |
case_50.txt | AC | 4 ms | 1536 KB |
case_51.txt | AC | 4 ms | 1536 KB |
case_52.txt | AC | 4 ms | 1536 KB |
case_53.txt | AC | 4 ms | 1536 KB |
case_54.txt | AC | 4 ms | 1536 KB |
case_55.txt | AC | 4 ms | 1536 KB |
case_56.txt | AC | 4 ms | 1536 KB |
case_57.txt | AC | 4 ms | 1536 KB |
case_58.txt | AC | 4 ms | 1536 KB |
case_59.txt | AC | 4 ms | 1536 KB |
case_60.txt | AC | 4 ms | 1536 KB |
case_61.txt | AC | 4 ms | 1536 KB |
case_62.txt | AC | 4 ms | 1536 KB |
case_63.txt | AC | 4 ms | 1536 KB |
case_64.txt | AC | 4 ms | 1536 KB |
case_65.txt | AC | 4 ms | 1536 KB |
case_66.txt | AC | 4 ms | 1536 KB |
case_67.txt | AC | 4 ms | 1536 KB |
case_68.txt | AC | 4 ms | 1536 KB |
case_69.txt | AC | 4 ms | 1536 KB |
case_70.txt | WA | 1 ms | 256 KB |
case_71.txt | WA | 1 ms | 384 KB |
case_72.txt | WA | 1 ms | 384 KB |
case_73.txt | WA | 2 ms | 640 KB |
case_74.txt | WA | 1 ms | 384 KB |
case_75.txt | WA | 2 ms | 640 KB |
case_76.txt | WA | 1 ms | 256 KB |
case_77.txt | WA | 1 ms | 384 KB |
case_78.txt | WA | 1 ms | 384 KB |
case_79.txt | WA | 1 ms | 384 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 |