oj.uz

Submission #1009563

# Submission time Handle Problem Language Result Execution time Memory
1009563 2024-06-27T15:44:03 Z yeediot Virus Experiment (JOI19_virus) C++17
100 / 100
 176 ms 30212 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 1e5+5, inf = 1e18, mxc = 805;
int w[2*mxn];
vector<pii>dir = {{-1, 0}, {0, 1}, {0, -1}, {1, 0}};
int t, n, m, mxw = 0, mxe = 0, v[mxc][mxc], len[16], to[mxc*mxc], num[mxc*mxc], col[mxc][mxc], cur, an[mxc][mxc];
bool owo[mxc*mxc];
int find(int x){
    return x == to[x] ? x : to[x] = find(to[x]);
}
void merge(int x, int y){
    x = find(x);
    y = find(y);
    if(x == y) return ;
    num[y] += num[x];
    to[x] = y;
}
bool check(int x, int y){
    if(v[x][y] == 0) return 0;
    int mask = 0, i = 0;
    for(auto [dx, dy] : dir){
        int nx = x + dx;
        int ny = y + dy;
        if(col[nx][ny] == cur) mask |= (1 << i);
        i++;
    }
    return len[mask] >= v[x][y];
}
bool bfs(int sx, int sy){
    queue<pair<int,int>> q;
    q.push({sx, sy});
    int sid = sx*m+sy, cnt = 0;
    col[sx][sy] = ++cur;
    while(sz(q)){
        auto [nx, ny] = q.front();
        //debug(nx, ny);
        q.pop();
        cnt++;
        int nid = nx*m+ny;
        if(find(nid) != find(sid)) {
            merge(sid, nid);
            return 1;
        }
        for(auto [dx, dy] : dir){
            int x = nx + dx;
            int y = ny + dy;
            if(!(1 <= x and x <= n and 1 <= y and y <= m)) continue;
            if(col[x][y] == col[sx][sy]) continue;
            if(!check(x, y)) continue;
            col[x][y] = col[sx][sy];
            q.push({x, y});
        }
    }
    //debug('\n');
    an[sx][sy] = cnt;
    return 0;
}
signed main(){
    TOI_is_so_de;
    cin >> t >> n >> m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            num[i*m+j] = 1;
            to[i*m+j] = i*m+j;
            owo[i*m+j] = 1;
            an[i][j] = inf;
        }
    }
    for(int i=1;i<=t;i++){
        char c;
        cin >> c;
        if(c == 'W'){
            w[i] = 2;
        }
        else if(c == 'N'){
            w[i] = 0;
        }
        else if(c == 'E'){
            w[i] = 1;
        }
        else {
            w[i] = 3;
        }
        w[i+t] = w[i];
    }
    int cnt = 0;
    for(int i = 0; i < 16; i++){
        cnt = 0;
        for(int j = 1; j <= 2*t; j++){
            if(i >> w[j] & 1){
                chmax(len[i], ++cnt);
            }
            else{
                cnt = 0;
            }
        }
        if(len[i] == 2*t) len[i] = inf;
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> v[i][j];
        }
    }
    /*for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cerr << find(i*m+j) << ' ';
        }
        cerr << '\n';
    }
    cerr << '\n';*/
    while(1){
        bool flag = 0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(v[i][j] == 0) continue;
                int id = i*m+j;
                if(to[id] != id) continue;
                if(owo[id] == 0) continue;
                flag |= bfs(i, j);
            }
        }
        /*for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                cerr << find(i*m+j) << ' ';
            }
            cerr << '\n';
        }
        cerr << '\n';*/
        if(!flag) break;
    }
    int ans = inf;
    cnt = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            int id = i*m+j;
            if(to[id] != id or v[i][j] == 0) continue;
            bfs(i, j);
            //cerr << to[id] << ',' << id << ',' << an[i][j] << ' ';
            if(ans > an[i][j]){
                ans = an[i][j];
                cnt = an[i][j];
            }
            else if(ans == an[i][j]){
                cnt += an[i][j];
            }
        }
        //cerr << '\n';
    }
    cout << ans << '\n' << cnt << '\n';
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
     function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
         std::ifstream file1(p1);
         std::ifstream file2(p2);
         if (!file1.is_open() || !file2.is_open())return false;
         std::string line1, line2;
         while (getline(file1, line1) && getline(file2, line2)) {
             if (line1 != line2)return false;
         }
         int cnta=0,cntb=0;
         while(getline(file1,line1))cnta++;
         while(getline(file2,line2))cntb++;
         return cntb-cnta<=1;
     };
     bool check = compareFiles("output.txt","expected.txt");
     if (check) cerr<<"ACCEPTED\n";
     else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

Compilation message

virus.cpp: In function 'void setIO(std::string)':
virus.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
virus.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1372 KB Output is correct
2 Correct 131 ms 26068 KB Output is correct
3 Correct 96 ms 29732 KB Output is correct
4 Correct 88 ms 28196 KB Output is correct
5 Correct 166 ms 30032 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 160 ms 29024 KB Output is correct
8 Correct 75 ms 16976 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 4 ms 2136 KB Output is correct
3 Correct 13 ms 9488 KB Output is correct
4 Correct 5 ms 2396 KB Output is correct
5 Correct 12 ms 2156 KB Output is correct
6 Correct 12 ms 2648 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 13 ms 2616 KB Output is correct
9 Correct 2 ms 3032 KB Output is correct
10 Correct 4 ms 2140 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 11 ms 2656 KB Output is correct
14 Correct 11 ms 8028 KB Output is correct
15 Correct 11 ms 3960 KB Output is correct
16 Correct 11 ms 2652 KB Output is correct
17 Correct 7 ms 1884 KB Output is correct
18 Correct 2 ms 5212 KB Output is correct
19 Correct 17 ms 2636 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1372 KB Output is correct
2 Correct 131 ms 26068 KB Output is correct
3 Correct 96 ms 29732 KB Output is correct
4 Correct 88 ms 28196 KB Output is correct
5 Correct 166 ms 30032 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 160 ms 29024 KB Output is correct
8 Correct 75 ms 16976 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 4 ms 2136 KB Output is correct
11 Correct 13 ms 9488 KB Output is correct
12 Correct 5 ms 2396 KB Output is correct
13 Correct 12 ms 2156 KB Output is correct
14 Correct 12 ms 2648 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 13 ms 2616 KB Output is correct
17 Correct 2 ms 3032 KB Output is correct
18 Correct 4 ms 2140 KB Output is correct
19 Correct 2 ms 1116 KB Output is correct
20 Correct 2 ms 1116 KB Output is correct
21 Correct 11 ms 2656 KB Output is correct
22 Correct 11 ms 8028 KB Output is correct
23 Correct 11 ms 3960 KB Output is correct
24 Correct 11 ms 2652 KB Output is correct
25 Correct 7 ms 1884 KB Output is correct
26 Correct 2 ms 5212 KB Output is correct
27 Correct 17 ms 2636 KB Output is correct
28 Correct 154 ms 29080 KB Output is correct
29 Correct 109 ms 29004 KB Output is correct
30 Correct 92 ms 29264 KB Output is correct
31 Correct 115 ms 28256 KB Output is correct
32 Correct 108 ms 27984 KB Output is correct
33 Correct 99 ms 27560 KB Output is correct
34 Correct 176 ms 28240 KB Output is correct
35 Correct 130 ms 21076 KB Output is correct
36 Correct 175 ms 27756 KB Output is correct
37 Correct 151 ms 28560 KB Output is correct
38 Correct 147 ms 28192 KB Output is correct
39 Correct 132 ms 30032 KB Output is correct
40 Correct 143 ms 30212 KB Output is correct
41 Correct 89 ms 28360 KB Output is correct
42 Correct 164 ms 28356 KB Output is correct
43 Correct 95 ms 29340 KB Output is correct
44 Correct 86 ms 17088 KB Output is correct