oj.uz

Submission #467168

# Submission time Handle Problem Language Result Execution time Memory
467168 2021-08-21T19:49:13 Z mtxas T-Covering (eJOI19_covering) C++14
100 / 100
 165 ms 58864 KB 
#include <bits/stdc++.h>

#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define pll pair<ll, ll>
#define mii map<int, int>
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(x) ((int)x.size())
#define turbo() cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false)
#define _fre() freopen("input.txt", "r", stdin)
#define _for(a, b, c) for(int (a) = (b); (a) < (c); (a)++)
#define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); (a)++)
#define _forneq(a, b, c) for(int (a) = (b); (a) >= (c); (a)--)
#define _forn(a, b, c) for(int (a) = (b); (a) > (c); (a)--)
using namespace std;
#define int ll
#define MyMin(a, b) if(a>b) a= b;
/**********************************************************************************
                                STRUCTS
**********************************************************************************/

/**********************************************************************************
                               VARIABLES
**********************************************************************************/
int n, m, k, ans = 0;
bool pos = 1;
const int inf = 0x3f3f3f3f;
vector<vi> table;
vector<pii> specials;
vector<vi> col;
vector<vector<bool>> isSpecial;
vector<int> colCnt;
vector<int> colSum;
vector<int> colMin;
vector<int> p;
vector<int> dydis;
int dy[12] = {-1, 0, 1, 0, -2, -1, 0, 1, 2, 1, 0, -1};
int dx[12] = {0, 1, 0, -1, 0, 1, 2, 1, 0, -1, -2, -1};
/**********************************************************************************
                               FUNCTIONS
**********************************************************************************/
int cellId(int r, int c){
    //assert(n*(r-1) + c <= m*n);
    return m*(r-1) + c;
}
bool inRange(int r, int c){
    return 1 <= r && r<=n && 1<=c && c<=m;
}
void prepVectors(){
    colCnt.resize(m*n+1);
    colSum.resize(m*n+1);
    colMin.resize(m*n+1, inf);
    isSpecial.resize(n+2, vector<bool>(m+2, 0));
    col.resize(n+2, vi(m+2, 0));
    dydis.resize(m*n+1);
    p.resize(m*n+1, 0);
}
void prepTable(){
    table.resize(n+2, vi(m+2, 0));
    _foreq(i, 1, n) _foreq(j, 1, m) cin>>table[i][j];
}
void getSpecialCells(){
    cin>>k;
    _for(i, 0, k) {
        int r, c; cin>>r>>c; r++, c++;
        specials.pb({r, c});
    }
    for(auto [r, c]: specials)
        isSpecial[r][c] = 1;
}
void prepDsu(){
    for(auto [r, c]: specials)
        p[cellId(r, c)] = cellId(r, c);
    _foreq(i, 1, m*n) dydis[i] = 1;
}
void readInput(){
    cin>>n>>m;
    prepTable();
    prepVectors();
    getSpecialCells();
    prepDsu();
}
int finder(int x){
    if(p[x] == x) return x;
    return p[x] = finder(p[x]);
}
bool same(int a, int b){return finder(a) == finder(b);}
void unite(int a, int b){
    a = finder(a);
    b = finder(b);
    if(same(a, b)) return;
    p[a] = b;
    dydis[b] += dydis[a];
}
void uniteComps(){
    for(auto [r, c]: specials)
        _for(dir, 0, 12){
            int rr = r + dy[dir], cc = c+dx[dir];
            if(inRange(rr, cc))
                if(isSpecial[rr][cc])
                    unite(
                          cellId(r, c),
                          cellId(rr, cc)
                          );

        }
}
void colorTable(){
    for(auto [r, c]: specials){
        int color = finder(cellId(r, c));
        _for(dir, 0, 4){
            int rr = r + dy[dir], cc = c+dx[dir];
            col[rr][cc] = color;
        }
        col[r][c] = color;
    }
     _foreq(i, 1, n) _foreq(j, 1, m){
        if(col[i][j] > 0){
            int c = col[i][j];
            colCnt[c]++;
            colSum[c] += table[i][j];
            if(!isSpecial[i][j]) MyMin(colMin[c], table[i][j]);
        }
     }
}
void checkComponents(){
    for(auto [r, c]: specials){
        int id = cellId(r, c);
        if(p[id] == id){
            int k = dydis[id];
            int cnt = colCnt[id] - dydis[id];
            if(cnt < 3*k) pos = 0;
            else if(cnt == 3*k) {
                ans += colSum[id];
            }
            else {
                ans += colSum[id] - colMin[id];
            }
        }
    }
}
/**********************************************************************************
                                 MAIN
**********************************************************************************/
signed main(){
    //_fre();
    turbo();
    readInput(); // also prepares everything
    uniteComps();
    colorTable();
    checkComponents();
    if(!pos) cout<<"No";
    else cout<<ans;
}

Compilation message

covering.cpp: In function 'void prepTable()':
covering.cpp:17:33: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   17 | #define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); (a)++)
      |                                 ^
covering.cpp:65:5: note: in expansion of macro '_foreq'
   65 |     _foreq(i, 1, n) _foreq(j, 1, m) cin>>table[i][j];
      |     ^~~~~~
covering.cpp:17:33: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   17 | #define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); (a)++)
      |                                 ^
covering.cpp:65:21: note: in expansion of macro '_foreq'
   65 |     _foreq(i, 1, n) _foreq(j, 1, m) cin>>table[i][j];
      |                     ^~~~~~
covering.cpp: In function 'void getSpecialCells()':
covering.cpp:16:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define _for(a, b, c) for(int (a) = (b); (a) < (c); (a)++)
      |                               ^
covering.cpp:69:5: note: in expansion of macro '_for'
   69 |     _for(i, 0, k) {
      |     ^~~~
covering.cpp:73:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   73 |     for(auto [r, c]: specials)
      |              ^
covering.cpp: In function 'void prepDsu()':
covering.cpp:77:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   77 |     for(auto [r, c]: specials)
      |              ^
covering.cpp:17:33: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   17 | #define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); (a)++)
      |                                 ^
covering.cpp:79:5: note: in expansion of macro '_foreq'
   79 |     _foreq(i, 1, m*n) dydis[i] = 1;
      |     ^~~~~~
covering.cpp: In function 'void uniteComps()':
covering.cpp:101:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  101 |     for(auto [r, c]: specials)
      |              ^
covering.cpp:16:31: warning: unnecessary parentheses in declaration of 'dir' [-Wparentheses]
   16 | #define _for(a, b, c) for(int (a) = (b); (a) < (c); (a)++)
      |                               ^
covering.cpp:102:9: note: in expansion of macro '_for'
  102 |         _for(dir, 0, 12){
      |         ^~~~
covering.cpp: In function 'void colorTable()':
covering.cpp:114:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  114 |     for(auto [r, c]: specials){
      |              ^
covering.cpp:16:31: warning: unnecessary parentheses in declaration of 'dir' [-Wparentheses]
   16 | #define _for(a, b, c) for(int (a) = (b); (a) < (c); (a)++)
      |                               ^
covering.cpp:116:9: note: in expansion of macro '_for'
  116 |         _for(dir, 0, 4){
      |         ^~~~
covering.cpp:17:33: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   17 | #define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); (a)++)
      |                                 ^
covering.cpp:122:6: note: in expansion of macro '_foreq'
  122 |      _foreq(i, 1, n) _foreq(j, 1, m){
      |      ^~~~~~
covering.cpp:17:33: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   17 | #define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); (a)++)
      |                                 ^
covering.cpp:122:22: note: in expansion of macro '_foreq'
  122 |      _foreq(i, 1, n) _foreq(j, 1, m){
      |                      ^~~~~~
covering.cpp: In function 'void checkComponents()':
covering.cpp:132:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  132 |     for(auto [r, c]: specials){
      |              ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 4 ms 1996 KB Output is correct
3 Correct 11 ms 5780 KB Output is correct
4 Correct 33 ms 16920 KB Output is correct
5 Correct 109 ms 55432 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 4 ms 2012 KB Output is correct
3 Correct 13 ms 5836 KB Output is correct
4 Correct 33 ms 16836 KB Output is correct
5 Correct 108 ms 55432 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 4 ms 1972 KB Output is correct
3 Correct 11 ms 5836 KB Output is correct
4 Correct 35 ms 16916 KB Output is correct
5 Correct 108 ms 55448 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 6 ms 3276 KB Output is correct
4 Correct 4 ms 1996 KB Output is correct
5 Correct 12 ms 6220 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 4 ms 1996 KB Output is correct
3 Correct 11 ms 5780 KB Output is correct
4 Correct 33 ms 16920 KB Output is correct
5 Correct 109 ms 55432 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 4 ms 2012 KB Output is correct
8 Correct 13 ms 5836 KB Output is correct
9 Correct 33 ms 16836 KB Output is correct
10 Correct 108 ms 55432 KB Output is correct
11 Correct 2 ms 844 KB Output is correct
12 Correct 4 ms 1972 KB Output is correct
13 Correct 11 ms 5836 KB Output is correct
14 Correct 35 ms 16916 KB Output is correct
15 Correct 108 ms 55448 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 6 ms 3276 KB Output is correct
19 Correct 4 ms 1996 KB Output is correct
20 Correct 12 ms 6220 KB Output is correct
21 Correct 2 ms 844 KB Output is correct
22 Correct 4 ms 1996 KB Output is correct
23 Correct 12 ms 5852 KB Output is correct
24 Correct 33 ms 16912 KB Output is correct
25 Correct 108 ms 55432 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 4 ms 1996 KB Output is correct
3 Correct 11 ms 5780 KB Output is correct
4 Correct 33 ms 16920 KB Output is correct
5 Correct 109 ms 55432 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 4 ms 2012 KB Output is correct
8 Correct 13 ms 5836 KB Output is correct
9 Correct 33 ms 16836 KB Output is correct
10 Correct 108 ms 55432 KB Output is correct
11 Correct 2 ms 844 KB Output is correct
12 Correct 4 ms 1972 KB Output is correct
13 Correct 11 ms 5836 KB Output is correct
14 Correct 35 ms 16916 KB Output is correct
15 Correct 108 ms 55448 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 6 ms 3276 KB Output is correct
19 Correct 4 ms 1996 KB Output is correct
20 Correct 12 ms 6220 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 2 ms 844 KB Output is correct
27 Correct 4 ms 1996 KB Output is correct
28 Correct 12 ms 5852 KB Output is correct
29 Correct 33 ms 16912 KB Output is correct
30 Correct 108 ms 55432 KB Output is correct
31 Correct 165 ms 58864 KB Output is correct
32 Correct 109 ms 55236 KB Output is correct
33 Correct 136 ms 57796 KB Output is correct
34 Correct 110 ms 55308 KB Output is correct
35 Correct 163 ms 56432 KB Output is correct