Submission #1652018
Source Code Expand
// need #include <iostream> #include <algorithm> // data structure #include <bitset> //#include <list> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <utility> #include <vector> #include <array> //#include <tuple> //#include <unordered_map> #include <unordered_set> #include <complex> //#include <deque> #include <valarray> // stream //#include <istream> //#include <sstream> //#include <ostream> //#include <fstream> // etc #include <cassert> #include <cmath> #include <functional> #include <iomanip> //#include <typeinfo> #include <chrono> #include <random> #include <numeric> // input #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; } template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); } #define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);} template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); } template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); } template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; } template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); } #define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i; // output #define OUT(d) std::cout<<d; #define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d; #define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d; #define SP std::cout<<" "; #define TAB std::cout<<"\t"; #define BR std::cout<<"\n"; #define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' '); #define ENDL std::cout<<std::endl; #define FLUSH std::cout<<std::flush; #define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";} #define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";} #define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}} #define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";} // utility #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i<int(n);++i) #define RREP(i, n) for(int i=int(n)-1;i>=0;--i) #define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i) #define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i) #define REPLL(i, n) for(ll i=0;i<ll(n);++i) #define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i) #define IN(a, x, b) (a<=x && x<b) template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; } template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } #define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]" #define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;} void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; } // test template<class T> std::vector<std::vector<T>> VV(int n) { return std::vector<std::vector<T>>(n); } template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) { return std::vector<std::vector<T>>(n, std::vector<T>(m, init)); } template<typename S, typename T> std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; } // type/const #define int ll using ll = long long; using ull = unsigned long long; using ld = long double; using PAIR = std::pair<int, int>; using PAIRLL = std::pair<ll, ll>; constexpr int INFINT = 1 << 30; // 1.07x10^ 9 constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9 constexpr ll INFLL = 1LL << 60; // 1.15x10^18 constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18 constexpr double EPS = 1e-7; constexpr int MOD = 1000000007; constexpr double PI = 3.141592653589793238462643383279; signed main() { INIT; VAR(int, n, m, x, a, p); if (a % p == 0) { int x2 = (x + a) % p; if (x <= x2) { OUT(0)BR; } else { OUT((n - 1) * 2)BR; } return 0; } std::vector<int> v; std::vector<std::vector<int>> g(n, std::vector<int>(m)); std::map<int, PAIR> map; REP(i, n) REP(j, m) { v.emplace_back(x); map[x] = PAIR(i, j); g[i][j] = x; x = (x + a) % p; } std::sort(ALL(v)); int ans = 0; REP(i, n) { std::vector<int> b(m, 0); int cnt = 0; REP(j, m) { PAIR p = map[v[i*m + j]]; cnt += std::abs(p.first - i); ++b[p.second]; } int l = 0; int rest = 0; REP(r, m) { if (b[r] > 1) { rest += b[r] - 1; b[r] = 1; } while (l < m) { if (b[l] > 0) { ++l; continue; } if (rest > 0) { cnt += std::abs(l - r); ++b[l++]; --rest; continue; } break; } } ans += cnt; } OUT(ans)BR; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 席替え |
User | satanic0258 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 5886 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 1024 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 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 | 384 KB |
case_02.txt | AC | 2 ms | 512 KB |
case_03.txt | AC | 2 ms | 384 KB |
case_04.txt | AC | 1 ms | 256 KB |
case_05.txt | AC | 1 ms | 384 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 | 384 KB |
case_10.txt | AC | 2 ms | 512 KB |
case_11.txt | AC | 1 ms | 384 KB |
case_12.txt | AC | 3 ms | 640 KB |
case_13.txt | AC | 1 ms | 256 KB |
case_14.txt | AC | 2 ms | 452 KB |
case_15.txt | AC | 3 ms | 768 KB |
case_16.txt | AC | 3 ms | 768 KB |
case_17.txt | AC | 2 ms | 512 KB |
case_18.txt | AC | 2 ms | 512 KB |
case_19.txt | AC | 4 ms | 1024 KB |
case_20.txt | AC | 2 ms | 512 KB |
case_21.txt | AC | 3 ms | 640 KB |
case_22.txt | AC | 1 ms | 256 KB |
case_23.txt | AC | 3 ms | 768 KB |
case_24.txt | AC | 3 ms | 640 KB |
case_25.txt | AC | 2 ms | 384 KB |
case_26.txt | AC | 3 ms | 640 KB |
case_27.txt | AC | 2 ms | 512 KB |
case_28.txt | AC | 1 ms | 256 KB |
case_29.txt | AC | 2 ms | 640 KB |
case_30.txt | AC | 3 ms | 768 KB |
case_31.txt | AC | 1 ms | 384 KB |
case_32.txt | AC | 1 ms | 256 KB |
case_33.txt | AC | 3 ms | 640 KB |
case_34.txt | AC | 3 ms | 640 KB |
case_35.txt | AC | 2 ms | 384 KB |
case_36.txt | AC | 2 ms | 512 KB |
case_37.txt | AC | 1 ms | 256 KB |
case_38.txt | AC | 1 ms | 256 KB |
case_39.txt | AC | 3 ms | 768 KB |
case_40.txt | AC | 2 ms | 512 KB |
case_41.txt | AC | 2 ms | 384 KB |
case_42.txt | AC | 1 ms | 384 KB |
case_43.txt | AC | 2 ms | 384 KB |
case_44.txt | AC | 1 ms | 256 KB |
case_45.txt | AC | 2 ms | 512 KB |
case_46.txt | AC | 2 ms | 512 KB |
case_47.txt | AC | 4 ms | 896 KB |
case_48.txt | AC | 1 ms | 256 KB |
case_49.txt | AC | 1 ms | 256 KB |
case_50.txt | AC | 4 ms | 1024 KB |
case_51.txt | AC | 5 ms | 1024 KB |
case_52.txt | AC | 5 ms | 1024 KB |
case_53.txt | AC | 4 ms | 1024 KB |
case_54.txt | AC | 5 ms | 1024 KB |
case_55.txt | AC | 4 ms | 1024 KB |
case_56.txt | AC | 4 ms | 1024 KB |
case_57.txt | AC | 4 ms | 1024 KB |
case_58.txt | AC | 4 ms | 1024 KB |
case_59.txt | AC | 4 ms | 1024 KB |
case_60.txt | AC | 4 ms | 1024 KB |
case_61.txt | AC | 4 ms | 1024 KB |
case_62.txt | AC | 4 ms | 1024 KB |
case_63.txt | AC | 4 ms | 1024 KB |
case_64.txt | AC | 4 ms | 1024 KB |
case_65.txt | AC | 4 ms | 1024 KB |
case_66.txt | AC | 4 ms | 1024 KB |
case_67.txt | AC | 4 ms | 1024 KB |
case_68.txt | AC | 4 ms | 1024 KB |
case_69.txt | AC | 4 ms | 1024 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 | 1 ms | 256 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 |