oj.uz

Submission #588641

# Submission time Handle Problem Language Result Execution time Memory
588641 2022-07-03T18:42:27 Z wiwiho Virus Experiment (JOI19_virus) C++14
100 / 100
 268 ms 19156 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int R, C;
int n, m;
vector<vector<int>> u;
vector<int> dsu, sz;
vector<int> lst;
vector<int> ans;
vector<int> lim;
vector<vector<int>> vst;
int tme = 0, ts = 0;
int mnans = INT_MAX;

vector<char> cs = {'N', 'S', 'W', 'E'};
vector<pii> dir = {mp(-1, 0), mp(1, 0), mp(0, -1), mp(0, 1)};
vector<int> cid;

void init(){
    n = R * C;
    u.resize(R, vector<int>(C));
    dsu.resize(n);
    sz.resize(n, 1);
    iota(iter(dsu), 0);
    lst.resize(n);
    ans.resize(n, -1);
    lim.resize(16);
    cid.resize(26);
    vst.resize(R, vector<int>(C));
    for(int i = 0; i < 4; i++) cid[cs[i] - 'A'] = i;
}

int findDSU(int a){
    if(dsu[a] != a) dsu[a] = findDSU(dsu[a]);
    return dsu[a];
}

void unionDSU(int a, int b){
    a = findDSU(a);
    b = findDSU(b);
    if(a == b) return;
    //cerr << "union " << a / C << ',' << a % C << " " << b / C << ',' << b % C << " " << tme << "\n";
    dsu[b] = dsu[a];
    sz[a] += sz[b];
    lst[a] = tme;
}

int getid(int x, int y){
    if(x < 0 || R <= x || y < 0 || C <= y) return -1;
    return x * C + y;
}

bool check(int x, int y){
    if(u[x][y] == 0) return false;
    int tmp = 0;
    for(int i = 0; i < 4; i++){
        int nx = x + dir[i].F, ny = y + dir[i].S;
        int id = getid(nx, ny);
        if(id == -1) continue;
        if(vst[nx][ny] == ts) tmp |= 1 << i;
    }
    return lim[tmp] >= u[x][y];
}

bool bfs(int sx, int sy){
    ts++;
    bool ok = false;
    int cnt = 0;
    int sid = getid(sx, sy);
    queue<pii> q;
    vst[sx][sy] = ts;
    q.push(mp(sx, sy));
    while(!q.empty()){
        int x = q.front().F, y = q.front().S;
        q.pop();
        int id = getid(x, y);
        cnt++;
        if(findDSU(sid) != findDSU(id)){
            unionDSU(id, sid);
            ok = true;
            break;
        }
        for(auto [dx, dy] : dir){
            int nx = x + dx, ny = y + dy;
            int nid = getid(nx, ny);
            if(nid == -1) continue;
            if(vst[nx][ny] == ts) continue;
            if(!check(nx, ny)) continue;
            vst[nx][ny] = ts;
            q.push(mp(nx, ny));
        }
    }
    if(!ok){
        ans[findDSU(sid)] = cnt;
        //cerr << "ans " << sx << " " << sy << " : " << cnt << "\n";
        if(cnt < mnans){
            mnans = cnt;
        }
    }
    return ok;
}

int main(){
    StarBurstStream

    cin >> m >> R >> C;
    string s;
    cin >> s;
    for(int i = 0; i < m; i++) s += s[i];
    init();
    for(int i = 0; i < R; i++){
        for(int j = 0; j < C; j++) cin >> u[i][j];
    }
    
    for(int i = 0; i < 16; i++){
        int now = 0;
        int mx = 0;
        for(int j = 0; j < 2 * m; j++){
            int id = cid[s[j] - 'A'];
            if(!(1 << id & i)){
                now = 0;
                continue;
            }
            now++;
            mx = max(mx, now);
        }
        if(mx == 2 * m) mx = MAX;
        lim[i] = mx;
        //cerr << bitset<4>(i) << ": " << lim[i] << "\n";
    }

    while(true){
        tme++;
        //cerr << "round " << tme << "\n";
        bool ok = false;
        for(int i = 0; i < R; i++){
            for(int j = 0; j < C; j++){
                if(u[i][j] == 0) continue;
                int id = getid(i, j);
                if(id != findDSU(id)) continue;
                if(ans[id] != -1) continue;
                if(lst[id] == tme) continue;
                //cerr << "check " << i << " " << j << " " << lst[id] << " " << tme << "\n";
                if(bfs(i, j)) ok = true;
            }
        }
        //cerr << "map:\n";
        for(int i = 0; i < R; i++){
            for(int j = 0; j < C; j++){
                int t = findDSU(getid(i, j));
                //cerr << t / C << "," << t % C << " ";
            }
            //cerr << "\n";
        }
        if(!ok) break;
    }

    int anscnt = 0;
    
    for(int i = 0; i < R; i++){
        for(int j = 0; j < C; j++){
            int id = getid(i, j);
            if(findDSU(id) != id) continue;
            if(ans[id] != mnans) continue;
            anscnt += min(mnans, sz[id]);
        }
    }

    cout << mnans << "\n" << anscnt << "\n";

    return 0;
}

Compilation message

virus.cpp: In function 'bool bfs(int, int)':
virus.cpp:142:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  142 |         for(auto [dx, dy] : dir){
      |                  ^
virus.cpp: In function 'int main()':
virus.cpp:209:21: warning: unused variable 't' [-Wunused-variable]
  209 |                 int t = findDSU(getid(i, j));
      |                     ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 178 ms 16744 KB Output is correct
3 Correct 205 ms 19016 KB Output is correct
4 Correct 119 ms 16688 KB Output is correct
5 Correct 126 ms 19156 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 172 ms 16976 KB Output is correct
8 Correct 54 ms 7892 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 5 ms 692 KB Output is correct
3 Correct 19 ms 732 KB Output is correct
4 Correct 5 ms 732 KB Output is correct
5 Correct 16 ms 732 KB Output is correct
6 Correct 18 ms 732 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 15 ms 732 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 5 ms 732 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 14 ms 732 KB Output is correct
14 Correct 16 ms 732 KB Output is correct
15 Correct 16 ms 732 KB Output is correct
16 Correct 14 ms 732 KB Output is correct
17 Correct 9 ms 596 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 15 ms 732 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 178 ms 16744 KB Output is correct
3 Correct 205 ms 19016 KB Output is correct
4 Correct 119 ms 16688 KB Output is correct
5 Correct 126 ms 19156 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 172 ms 16976 KB Output is correct
8 Correct 54 ms 7892 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 5 ms 692 KB Output is correct
11 Correct 19 ms 732 KB Output is correct
12 Correct 5 ms 732 KB Output is correct
13 Correct 16 ms 732 KB Output is correct
14 Correct 18 ms 732 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 15 ms 732 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 5 ms 732 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 14 ms 732 KB Output is correct
22 Correct 16 ms 732 KB Output is correct
23 Correct 16 ms 732 KB Output is correct
24 Correct 14 ms 732 KB Output is correct
25 Correct 9 ms 596 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 15 ms 732 KB Output is correct
28 Correct 221 ms 16972 KB Output is correct
29 Correct 229 ms 16952 KB Output is correct
30 Correct 265 ms 17068 KB Output is correct
31 Correct 200 ms 16300 KB Output is correct
32 Correct 213 ms 16412 KB Output is correct
33 Correct 131 ms 16692 KB Output is correct
34 Correct 268 ms 16740 KB Output is correct
35 Correct 177 ms 12884 KB Output is correct
36 Correct 246 ms 17080 KB Output is correct
37 Correct 220 ms 16832 KB Output is correct
38 Correct 196 ms 16696 KB Output is correct
39 Correct 171 ms 17876 KB Output is correct
40 Correct 204 ms 17924 KB Output is correct
41 Correct 136 ms 16808 KB Output is correct
42 Correct 218 ms 15928 KB Output is correct
43 Correct 213 ms 17028 KB Output is correct
44 Correct 66 ms 7796 KB Output is correct