oj.uz

Submission #237599

# Submission time Handle Problem Language Result Execution time Memory
237599 2020-06-07T15:43:22 Z Half T-Covering (eJOI19_covering) C++14
55 / 100
 323 ms 8312 KB 
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pi;
typedef long long ll;

#define loop(i,a,b) for (int i = a; i <= b; i++)

#define INF ((unsigned) ~0)
#define F first
#define S second
#define PB push_back
#define MP make_pair

int m, n, k, x;
ll res;
int a[1000000];
map<pi, int> sp;

int getA(int r, int c){
    if(n * r + c >= 0 && n * r + c < m * n && 0 <= r && r < m && 0 <= c && c < n)
        return a[n * r + c];
    return -1;
}

int& getAp(int r, int c){
    if(n * r + c >= 0 && n * r + c < m * n && 0 <= r && r < m && 0 <= c && c < n)
        return a[n * r + c];
    x = -1;
    return x;
}

bool chkNgb(int r, int c){
    if(n * r + c < 0 || n * r + c >= m * n || 0 > r || r >= m || 0 > c || c >= n)
        return true;
    if(sp.count(MP(r, c)) == 0)
        return true;
    if(sp[MP(r, c)] > 0)
        return true;
    int dn = 0;
    if(getA(r + 1, c) == -1)
        dn++;
    if(getA(r - 1, c) == -1)
        dn++;
    if(getA(r, c + 1) == -1)
        dn++;
    if(getA(r, c - 1) == -1)
        dn++;
    if(dn >= 2)
        return false;
    if(dn == 1){
        res += max(getA(r + 1, c), 0);
        res += max(getA(r - 1, c), 0);
        res += max(getA(r, c + 1), 0);
        res += max(getA(r, c - 1), 0);
        getAp(r + 1, c) = -1;
        getAp(r - 1, c) = -1;
        getAp(r, c + 1) = -1;
        getAp(r, c - 1) = -1;
        sp[MP(r, c)] = 1;
        return chkNgb(r + 2, c) && chkNgb(r - 2, c) && chkNgb(r, c + 2) && chkNgb(r, c - 2);
    }
    if(sp.count(MP(r + 1, c + 1)) > 0){
        res += max(getA(r + 1, c), 0);
        res += max(getA(r - 1, c), 0);
        res += max(getA(r, c - 1), 0);
        getAp(r + 1, c) = -1;
        getAp(r - 1, c) = -1;
        getAp(r, c - 1) = -1;
        sp[MP(r, c)] = 1;
        return chkNgb(r + 2, c) && chkNgb(r - 2, c) && chkNgb(r, c + 2) && chkNgb(r, c - 2);
    }
    if(sp.count(MP(r - 1, c + 1)) > 0){
        res += max(getA(r + 1, c), 0);
        res += max(getA(r - 1, c), 0);
        res += max(getA(r, c - 1), 0);
        getAp(r + 1, c) = -1;
        getAp(r - 1, c) = -1;
        getAp(r, c - 1) = -1;
        sp[MP(r, c)] = 1;
        return chkNgb(r + 2, c) && chkNgb(r - 2, c) && chkNgb(r, c + 2) && chkNgb(r, c - 2);
    }
    if(sp.count(MP(r + 1, c - 1)) > 0){
        res += max(getA(r + 1, c), 0);
        res += max(getA(r - 1, c), 0);
        res += max(getA(r, c + 1), 0);
        getAp(r + 1, c) = -1;
        getAp(r - 1, c) = -1;
        getAp(r, c + 1) = -1;
        sp[MP(r, c)] = 1;
        return chkNgb(r + 2, c) && chkNgb(r - 2, c) && chkNgb(r, c + 2) && chkNgb(r, c - 2);
    }
    if(sp.count(MP(r - 1, c - 1)) > 0){
        res += max(getA(r + 1, c), 0);
        res += max(getA(r - 1, c), 0);
        res += max(getA(r, c + 1), 0);
        getAp(r + 1, c) = -1;
        getAp(r - 1, c) = -1;
        getAp(r, c + 1) = -1;
        sp[MP(r, c)] = 1;
        return chkNgb(r + 2, c) && chkNgb(r - 2, c) && chkNgb(r, c + 2) && chkNgb(r, c - 2);
    }
    return true;
}

pi dfs(int r, int c, int pr, int pc){
    if(n * r + c < 0 || n * r + c >= m * n || sp.count(MP(r, c)) == 0 || 0 > r || r >= m || 0 > c || c >= n)
        return MP(0, 1001);
    if(sp[MP(r, c)] == 2){
        return MP(1, 1001);
    }
    sp[MP(r, c)] = 2;
    pi s = MP(0, 1001);
    for(int i = -1; i < 2; i += 2){
        for(int j = -1; j < 2; j += 2){
            res += max(getA(r + (i + j)/2, c + (i - j)/2), 0);
            if(getA(r + (i + j)/2, c + (i - j)/2) != -1)
                s.S = min(s.S, getA(r + (i + j)/2, c + (i - j)/2));
            getAp(r + (i + j)/2, c + (i - j)/2) = -1;
            if((r + i + j) != pr || (c + i - j) != pc){
                //cout << r + (i + j)/2 << " " << c + (i - j)/2 << ":" << getA(r + (i + j)/2, c + (i - j)/2) << "\n";
                pi p = dfs(r + i + j, c + i - j, r, c);
                s = MP(max(s.F, p.F), min(s.S, p.S));
            }
        }
    }
    return s;
}

int main(){
    res = 0;
    cin >> m >> n;
    for(int r = 0; r < m; r++)
        for(int c = 0; c < n; c++)
            cin >> a[n * r + c];
    cin >> k;
    for(int i = 0; i < k; i++){
        int r, c;
        cin >> r >> c;
        sp[MP(r, c)] = 0;
        res += a[n * r + c];
        a[n * r + c] = -1;
    }
    for(map<pi, int>::iterator it = sp.begin(); it != sp.end(); it++){
        if(!chkNgb((it->F).F, (it->F).S)){
            cout << "No\n";
            return 0;
        }
    }
    //cout << res << "\n";
    for(map<pi, int>::iterator it = sp.begin(); it != sp.end(); it++){
        int r = (it->F).F;
        int c = (it->F).S;
        //cout << sp[MP(r, c)] << "\n";
        if(sp[MP(r, c)] == 0){
            pi p = dfs(r, c, -10, -10);
            //cout << p.F << "\n";
            if(p.F == 0)
                res -= p.S;
        }
    }
    cout << res << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 14 ms 384 KB Output is correct
3 Correct 37 ms 1144 KB Output is correct
4 Correct 103 ms 2684 KB Output is correct
5 Correct 314 ms 8084 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 15 ms 512 KB Output is correct
3 Correct 37 ms 760 KB Output is correct
4 Correct 99 ms 2680 KB Output is correct
5 Correct 314 ms 8312 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 14 ms 512 KB Output is correct
3 Correct 36 ms 1156 KB Output is correct
4 Correct 98 ms 2680 KB Output is correct
5 Correct 323 ms 8184 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 20 ms 512 KB Output is correct
4 Correct 15 ms 512 KB Output is correct
5 Correct 37 ms 760 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Incorrect 5 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 14 ms 384 KB Output is correct
3 Correct 37 ms 1144 KB Output is correct
4 Correct 103 ms 2684 KB Output is correct
5 Correct 314 ms 8084 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 15 ms 512 KB Output is correct
8 Correct 37 ms 760 KB Output is correct
9 Correct 99 ms 2680 KB Output is correct
10 Correct 314 ms 8312 KB Output is correct
11 Correct 8 ms 384 KB Output is correct
12 Correct 14 ms 512 KB Output is correct
13 Correct 36 ms 1156 KB Output is correct
14 Correct 98 ms 2680 KB Output is correct
15 Correct 323 ms 8184 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 20 ms 512 KB Output is correct
19 Correct 15 ms 512 KB Output is correct
20 Correct 37 ms 760 KB Output is correct
21 Correct 8 ms 384 KB Output is correct
22 Correct 15 ms 512 KB Output is correct
23 Correct 37 ms 1144 KB Output is correct
24 Correct 96 ms 2680 KB Output is correct
25 Correct 317 ms 8312 KB Output is correct

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 14 ms 384 KB Output is correct
3 Correct 37 ms 1144 KB Output is correct
4 Correct 103 ms 2684 KB Output is correct
5 Correct 314 ms 8084 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 15 ms 512 KB Output is correct
8 Correct 37 ms 760 KB Output is correct
9 Correct 99 ms 2680 KB Output is correct
10 Correct 314 ms 8312 KB Output is correct
11 Correct 8 ms 384 KB Output is correct
12 Correct 14 ms 512 KB Output is correct
13 Correct 36 ms 1156 KB Output is correct
14 Correct 98 ms 2680 KB Output is correct
15 Correct 323 ms 8184 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 20 ms 512 KB Output is correct
19 Correct 15 ms 512 KB Output is correct
20 Correct 37 ms 760 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 4 ms 256 KB Output is correct
23 Incorrect 5 ms 256 KB Output isn't correct
24 Halted 0 ms 0 KB -