oj.uz

답안 #819112

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
819112 2023-08-10T08:04:01 Z fatemetmhr 바이러스 (JOI19_virus) C++17
20 / 100
 418 ms 262144 KB 
//  ~ Be Name Khoda ~  //
 
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")
 
using namespace std;
 
typedef long long ll;
 
#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second
 
const int maxn  =  1e6   + 10;
const int maxn3 =  810;
const int mod   =  1e9   + 7;
const ll  inf   =  1e18;
 
/*
 
* 0 *
1 X 2
* 3 *
 
*/
 
char c[4] = {'N', 'W', 'E', 'S'};
pair <int, int> adj[4] = {{1, 0}, {0, 1}, {0, -1}, {-1, 0}};
int mx[100], mark[maxn], cmp[maxn3][maxn3];
int a[maxn3][maxn3], n, m;
vector <pair<int, int>> ed[maxn], eversaw[maxn], av[maxn];
bool Run = false;
 
bool ok(int i, int j){
	return min(i, j) >= 0 && i < n && j < m && a[i][j];
}
 
bool check_ed(int x, int y, int a){
    if(cmp[x][y] == a)
        return false;
    int mask = 0;
    for(int i = 0; i < 4; i++) 
        if(ok(x - adj[i].fi, y - adj[i].se) && cmp[x - adj[i].fi][y - adj[i].se] == a)
            mask += (1 << i);
    return mx[mask] >= (::a[x][y]);
}
 
int merge(int a, int b){
	if(a == b)
		return a;
    if(av[a].size() < av[b].size())
        swap(a, b);
    for(auto [u, v] : av[b]){
        av[a].pb({u, v});
        cmp[u][v] = a;
    }
    for(auto [u, v] : av[b]) for(int i = 0; i < 4; i++) 
        if(ok(u + adj[i].fi, v + adj[i].se) && check_ed(u + adj[i].fi, v + adj[i].se, a))
            ed[a].pb({u + adj[i].fi, v + adj[i].se});
    for(auto p : ed[b]){
    	//cout << "it's " << p.fi << ' ' << p.se << endl;
        ed[a].pb(p);
    }
    for(auto p : eversaw[b])
        eversaw[a].pb(p);

	//cout << "here merge of " << a << ' ' << b << endl;
    return a;
}
 
bool dfs(int v){
    mark[v] = 1;
    while(ed[v].size()){
        int u = cmp[ed[v].back().fi][ed[v].back().se];
        pair <int, int> tmp = ed[v].back();
        //cout << v << ' ' << u << ' ' << mark[u] << ' ' << ed[v].back().fi << ' ' << ed[v].back().se << endl;
        if(u == v){
        	ed[v].pop_back();
        	continue;
        }
        eversaw[v].pb(ed[v].back());
        ed[v].pop_back();
        if(!mark[u]){
            if(dfs(u)){
            	if(eversaw[v].empty())
            		exit(0);
                v = merge(cmp[tmp.fi][tmp.se], v);
            }
            mark[v] = 1;
        }
        else if(mark[u] == 1){
            ed[v].pb(tmp);
            //cout << ed[v].back().fi << ' ' << ed[v].back().se << endl;
            //cout << "ha? " << v << ' ' << eversaw[v].size() << ' ' << eversaw[v].back().fi << ' ' << eversaw[v].back().se << endl;
            return true;
        }
    }
    mark[v] = 2;
    return false;
}
 
int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
 
    cin >> n >> n >> m;
    Run |= max(n, m) <= 50;
    string s; cin >> s;
    bool okk = true;
    for(int i = 0; i < s.size(); i++)
    	okk &= (s[i] == 'W' || s[i] == 'E');
    Run |= okk;
    Run ^= 1;
    string t = s;
    while(t.size() < 200000)
        t = t + s;
    s = t;
    for(int mask = 1; mask < (1 << 4); mask++){
        int last = 0;
        char av[4];
        for(int i = 0; i < 4; i++){
            if((mask >> i)&1)
                av[i] = c[i];
            else
                av[i] = 'X';
        }
        for(int i = 0; i < s.size(); i++){
            if(s[i] != av[0] && s[i] != av[1] && s[i] != av[2] && s[i] != av[3])
                last = i + 1;
            else
                mx[mask] = max(mx[mask], i - last + 1);
        }
    }
    //cout << mx[4] << endl;
    int l = 0, r = 0;
    int pt = 0;
    for(int i = 0; i < n; i++) for(int j = 0; j < m; j++)
    	cin >> a[i][j];
    for(int i = 0; i < n; i++) 
        for(int j = 0; j < m; j++){
            if(!a[i][j])
                continue;
            cmp[i][j] = pt;
            av[pt].pb({i, j});
            for(int x = 0; x < 4; x++) 
                if(ok(i + adj[x].fi, j + adj[x].se) && mx[(1 << x)] >= a[i + adj[x].fi][j + adj[x].se]){
                    ed[pt].pb({i + adj[x].fi, j + adj[x].se});
            }
            //cout << i << ' ' << j << ' ' << cmp[i][j] << ' ' << ed[pt].size() << endl;
            pt++;
        }
    for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) if(a[i][j] && !mark[cmp[i][j]])
        dfs(cmp[i][j]);
    int mn = n * m + 1, cnt = 0;
    memset(mark, false, sizeof mark);
    for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) if(a[i][j] && !mark[cmp[i][j]]){
        int re = true;
        mark[cmp[i][j]] = true;
        for(auto [u, v] : eversaw[cmp[i][j]]) if(cmp[u][v] != cmp[i][j]){
        	//cout << i << ' ' << j << ' ' << cmp[i][j] << ' ' << u << ' ' << v << ' ' << cmp[u][v] << endl;
            re = false;
        }
        if(re){
        	int val = av[cmp[i][j]].size();
        	//cout << i << ' ' << j << ' ' << cmp[i][j] << ' ' << val << endl;
        	if(val < mn){
        		mn = val;
        		cnt = val;
        	}
        	else if(val == mn)
        		cnt += val;
        }
    }
    cout << mn << endl << cnt << endl;
}

Compilation message

virus.cpp: In function 'int main()':
virus.cpp:114:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |     for(int i = 0; i < s.size(); i++)
      |                    ~~^~~~~~~~~~
virus.cpp:131:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |         for(int i = 0; i < s.size(); i++){
      |                        ~~^~~~~~~~~~
virus.cpp:139:9: warning: unused variable 'l' [-Wunused-variable]
  139 |     int l = 0, r = 0;
      |         ^
virus.cpp:139:16: warning: unused variable 'r' [-Wunused-variable]
  139 |     int l = 0, r = 0;
      |                ^

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 75240 KB Output is correct
2 Correct 418 ms 126344 KB Output is correct
3 Correct 409 ms 140312 KB Output is correct
4 Correct 215 ms 140224 KB Output is correct
5 Correct 113 ms 100140 KB Output is correct
6 Correct 305 ms 79272 KB Output is correct
7 Correct 238 ms 165904 KB Output is correct
8 Correct 75 ms 85284 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 299 ms 75668 KB Output is correct
2 Correct 36 ms 75196 KB Output is correct
3 Correct 55 ms 75240 KB Output is correct
4 Correct 42 ms 75264 KB Output is correct
5 Correct 49 ms 75152 KB Output is correct
6 Correct 56 ms 76176 KB Output is correct
7 Correct 56 ms 76040 KB Output is correct
8 Correct 49 ms 75404 KB Output is correct
9 Correct 62 ms 76884 KB Output is correct
10 Correct 37 ms 75232 KB Output is correct
11 Correct 294 ms 75576 KB Output is correct
12 Correct 57 ms 76560 KB Output is correct
13 Correct 52 ms 75844 KB Output is correct
14 Correct 49 ms 75700 KB Output is correct
15 Correct 49 ms 75780 KB Output is correct
16 Correct 47 ms 75652 KB Output is correct
17 Correct 57 ms 75568 KB Output is correct
18 Correct 46 ms 75764 KB Output is correct
19 Correct 54 ms 75396 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 75240 KB Output is correct
2 Correct 418 ms 126344 KB Output is correct
3 Correct 409 ms 140312 KB Output is correct
4 Correct 215 ms 140224 KB Output is correct
5 Correct 113 ms 100140 KB Output is correct
6 Correct 305 ms 79272 KB Output is correct
7 Correct 238 ms 165904 KB Output is correct
8 Correct 75 ms 85284 KB Output is correct
9 Correct 299 ms 75668 KB Output is correct
10 Correct 36 ms 75196 KB Output is correct
11 Correct 55 ms 75240 KB Output is correct
12 Correct 42 ms 75264 KB Output is correct
13 Correct 49 ms 75152 KB Output is correct
14 Correct 56 ms 76176 KB Output is correct
15 Correct 56 ms 76040 KB Output is correct
16 Correct 49 ms 75404 KB Output is correct
17 Correct 62 ms 76884 KB Output is correct
18 Correct 37 ms 75232 KB Output is correct
19 Correct 294 ms 75576 KB Output is correct
20 Correct 57 ms 76560 KB Output is correct
21 Correct 52 ms 75844 KB Output is correct
22 Correct 49 ms 75700 KB Output is correct
23 Correct 49 ms 75780 KB Output is correct
24 Correct 47 ms 75652 KB Output is correct
25 Correct 57 ms 75568 KB Output is correct
26 Correct 46 ms 75764 KB Output is correct
27 Correct 54 ms 75396 KB Output is correct
28 Runtime error 378 ms 262144 KB Execution killed with signal 9
29 Halted 0 ms 0 KB -