fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "difference"
  33.  
  34. const int MOD = 1e9 + 7;
  35. const int inf = 1e9 + 27092008;
  36. const ll INF = 1e18 + 27092008;
  37. const int N = 1e6 + 5;
  38. const int dx[] = {-1, 0};
  39. const int dy[] = {0, -1};
  40. int n, m, lab[N];
  41. array<int, 5> diff[2 * N];
  42.  
  43. int root(int v) {
  44.     return (lab[v] < 0 ? v : lab[v] = root(lab[v]));
  45. }
  46.  
  47. bool unite(int u, int v) {
  48.     u = root(u);
  49.     v = root(v);
  50.     if (u == v) return false;
  51.     if (lab[u] > lab[v]) swap(u, v);
  52.     lab[u] += lab[v];
  53.     lab[v] = u;
  54.     return true;
  55. }
  56.  
  57. int id(int i, int j) {
  58.     return i * m + j;
  59. }
  60.  
  61. void init(void) {
  62.     int subtask; cin >> subtask;
  63.     cin >> n >> m;
  64.     if (n == 1 && m == 1) {
  65.         cout << "1 0 1 1";
  66.         exit(0);
  67.     }
  68.     memset(lab, -1, sizeof lab);
  69. }
  70.  
  71. void process(void) {
  72.     vector<vector<int>> a(n, vector<int>(m, 0));
  73.     int num = 0;
  74.     REP(i, n) REP(j, m) {
  75.         cin >> a[i][j];
  76.         REP(dir, 2) {
  77.             int x = i + dx[dir];
  78.             int y = j + dy[dir];
  79.             if (x >= 0 && x < n && y >= 0 && y < m)
  80.                 diff[num++] = {abs(a[i][j] - a[x][y]), i, j, x, y};
  81.         }
  82.     }
  83.  
  84.     sort(diff, diff + num);
  85.     array<int, 4> ans = {inf, 0, 0, 0};
  86.     int i = 0;
  87.     while(i < num) {
  88.         int j = i;
  89.         while(j < num && diff[i][0] == diff[j][0]) {
  90.             int u = id(diff[j][1], diff[j][2]);
  91.             int v = id(diff[j][3], diff[j][4]);
  92.             unite(u, v);
  93.             j++;
  94.         }
  95.         array<int, 4> res = {inf, 0, 0, 0};
  96.         for(int k = i; k < j; k++) {
  97.             int u = id(diff[k][1], diff[k][2]);
  98.             int v = id(diff[k][3], diff[k][4]);
  99.             int sz = lab[root(u)];
  100.             minimize(res, {sz, diff[k][0], diff[k][1], diff[k][2]});
  101.             minimize(res, {sz, diff[k][0], diff[k][3], diff[k][4]});
  102.         }
  103.  
  104.         minimize(ans, res);
  105.  
  106.         for(int k = i; k < j; k++) {
  107.             int u = id(diff[k][1], diff[k][2]);
  108.             int v = id(diff[k][3], diff[k][4]);
  109.             lab[u] = lab[v] = -1;
  110.         }
  111.  
  112.         i = j;
  113.     }
  114.  
  115.     cout << -ans[0] << ' ' << ans[1] << ' ' << ans[2] + 1 << ' ' << ans[3] + 1;
  116. }
  117.  
  118. int main() {
  119.     ios_base::sync_with_stdio(0);
  120.     cin.tie(0); cout.tie(0);
  121.     if (fopen(task".inp", "r")) {
  122.         freopen(task".inp", "r", stdin);
  123.         freopen(task".out", "w", stdout);
  124.     }
  125.     int tc = 1;
  126. //    cin >> tc;
  127.     while(tc--) {
  128.         init();
  129.         process();
  130.     }
  131.     return 0;
  132. }
  133.  
Success #stdin #stdout 0.01s 9076KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
-1027092008 0 1 1
https://ideone.com/8zlewI
language:
C++14 (gcc 8.3)
created:
20 days 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!