fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2024-11-19 10:47:19
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2024-11-19 23:48:28
  6. */
  7. #include <bits/stdc++.h>
  8. #include <ext/pb_ds/assoc_container.hpp> 
  9. #include <ext/pb_ds/tree_policy.hpp> 
  10. // #pragma GCC optimize("O3")  
  11. // #pragma GCC optimize("unroll-loops")  
  12. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  13. using namespace std;
  14. using namespace __gnu_pbds; 
  15. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  16. #define int long long
  17. #define ll long long 
  18. #define ull unsigned long long
  19. #define sz(x) x.size()
  20. #define sqr(x) (1LL * (x) * (x))
  21. #define all(x) x.begin(), x.end()
  22. #define fill(f,x) memset(f,x,sizeof(f))
  23. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  24. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  25. #define debug(x) cout << #x << " = " << x << '\n'
  26. #define ii pair<int,int>
  27. #define iii pair<int,ii>
  28. #define di pair<ii,ii>
  29. #define vi vector<int>
  30. #define vii vector<ii>
  31. #define mii map<int,int>
  32. #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
  33. #define fi first
  34. #define se second
  35. #define pb push_back
  36. #define MOD 1000000007
  37. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  38. #define YES cout << "YES\n"
  39. #define NO cout << "NO\n"
  40. #define MASK(i) (1LL << (i))
  41. #define c_bit(i) __builtin_popcountll(i)
  42. #define BIT(x,i) ((x) & MASK(i))
  43. #define SET_ON(x,i) ((x) | MASK(i))
  44. #define SET_OFF(x,i) ((x) & ~MASK(i))
  45. #define oo 1e18
  46. #define name ""
  47. #define endl '\n'
  48. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms.";
  49. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  50. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  51. const int N = (int)1e6+10;
  52. int n,m,k;
  53. vi a[N];
  54. vector<vi> f,dp;
  55. vii g[N];
  56.  
  57. int getID(int x, int y)
  58. {
  59.     return (x-1)*m+y;
  60. }
  61.  
  62. namespace hungeazy {
  63.  
  64.     vi b[N];
  65.  
  66.     void reset()
  67.     {
  68.         FOR(i,1,n) b[i] = a[i];
  69.         FOR(i,0,n+1)
  70.             FOR(j,0,m+1) dp[i][j] = f[i][j] = 0;
  71.     }
  72.  
  73. 	void solve(void)
  74. 	{
  75.         int ans = oo;
  76.         FOR(col,1,2)
  77.         {
  78.             int sum = 0, cnt = 0;
  79.             reset();
  80.             bool check = true;
  81.             FOR(i,1,n)
  82.                 FOR(j,1,m+1)
  83.                 {
  84.                     f[i][j] += (f[i-1][j]+dp[i][j]);
  85.                     sum += f[i][j];
  86.                     if (j != m+1)
  87.                     {
  88.                         (b[i][j] += sum) %= 3;
  89.                         if (b[i][j] != col)
  90.                         {
  91.                             if (g[getID(i,j)].empty()) goto li;
  92.                             else  
  93.                             {
  94.                                 int val = ((col-b[i][j])%3+3)%3;
  95.                                 cnt += val;
  96.                                 for (auto [u,v] : g[getID(i,j)])
  97.                                 {
  98.                                     f[i][j] += val;
  99.                                     sum += val;
  100.                                     dp[i][j] += val;
  101.                                     dp[i][v+1] -= val;
  102.                                     dp[u+1][j] -= val;
  103.                                     dp[u+1][v+1] += val;
  104.                                 }
  105.                             }
  106.                         }
  107.                     }
  108.                 }
  109.             minimize(ans,cnt);
  110.             li:;
  111.         }
  112.         cout << (ans==oo?-1:ans);
  113. 	}
  114.  
  115. }
  116.  
  117. signed main()
  118. {
  119.     fast;
  120.     if (fopen(name".inp","r"))
  121.     {
  122.     	freopen(name".inp","r",stdin);
  123.     	freopen(name".out","w",stdout);
  124.     }
  125.     cin >> n >> m >> k;
  126.     f.resize(n+10,vi(m+10));
  127.     dp.resize(n+10,vi(m+10));
  128.     FOR(i,1,n)
  129.     {
  130.         a[i].pb(0);
  131.         FOR(j,1,m)
  132.         {
  133.             int x;
  134.             cin >> x;
  135.             a[i].pb(x);
  136.         }
  137.     }
  138.     FOR(i,1,k)
  139.     {
  140.         int x,y,u,v;
  141.         cin >> x >> y >> u >> v;
  142.         g[getID(x,y)].pb({u,v});
  143.     }
  144.     hungeazy::solve();
  145.     time();
  146.     return 0;
  147. }
  148. // ██░ ██  █    ██  ███▄    █   ▄████
  149. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  150. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  151. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  152. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  153. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  154. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  155. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  156. // ░  ░  ░   ░              ░       ░
  157.  
Success #stdin #stdout #stderr 0.02s 74132KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
-------------Time:13.78ms.
https://ideone.com/qmxR2r
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!