답안 #927204

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
927204	2024-02-14T12:07:47 Z	bachhoangxuan	영역 (JOI16_ho_t4)	C++17	100 / 100	139 ms	41336 KB

2016_ho_t4

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=100005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int dx[]={0,0,1,1},
    dy[]={0,1,0,1};

map<pii,int> mp;
map<pii,vector<piii>> g;
int n,K;
string s;

void solve(){
    cin >> n >> K >> s;
    int x=0,y=0;
    for(int t=0;t<4;t++){
        int xt=x+dx[t],yt=y+dy[t];
        mp[{xt,yt}]|=(1<<t);
    }
    for(char c:s){
        if(c=='E') y++;
        else if(c=='W') y--;
        else if(c=='N') x++;
        else x--;
        for(int t=0;t<4;t++){
            int xt=x+dx[t],yt=y+dy[t];
            mp[{xt,yt}]|=(1<<t);
        }
    }
    bool sx=false,sy=false;
    if(x<0) sx=true,x=-x;
    if(y<0) sy=true,y=-y;
    if(!x && !y) K=1;
    int total=0;
    for(auto [p,mask]:mp){
        auto [xt,yt]=p;
        if(sx) xt=-xt;
        if(sy) yt=-yt;
        int cx=xt,cy=yt;
        if(mask==15) total++;
        if(x!=0){
            int rx=(cx%x+x)%x;
            int d=(cx-rx)/x;
            int ry=cy-d*y;
            swap(rx,cx);
            swap(ry,cy);
        }
        else if(y!=0){
            int ry=(cy%y+y)%y;
            int d=(cy-ry)/y;
            int rx=cx-d*x;
            swap(rx,cx);
            swap(ry,cy);
        }
        g[mpp(cx,cy)].push_back({{xt,yt},mask});
        g[mpp(cx,cy)].push_back({{xt+x*K,yt+y*K},-mask});
    }
    if(K==1){
        cout << total << '\n';
        return;
    }
    int ans=0;
    for(auto [s,pos]:g){
        sort(pos.begin(),pos.end());
        //cout << "*******" << s.fi << ' ' << s.se << '\n';
        int px=-inf,py=-inf,add=0;
        vector<int> cur(4,0);
        for(auto [p,mask]:pos){
            auto [cx,cy]=p;
            //cout << cx << ' ' << cy << ' ' << mask << '\n';
            if(px!=-inf && *min_element(cur.begin(),cur.end())){
                if(x) add+=(cx-px)/x;
                else add+=(cy-py)/y;
            }
            for(int i=0;i<4;i++) if(abs(mask)>>i&1) cur[i]+=(mask<0?-1:1);
            px=cx;py=cy;
        }
        ans+=add;
        //cout << add << '\n';
    }
    cout << ans << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	464 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	456 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	464 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	456 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	5 ms	1408 KB	Output is correct
29	Correct	18 ms	4188 KB	Output is correct
30	Correct	20 ms	3776 KB	Output is correct
31	Correct	121 ms	33620 KB	Output is correct
32	Correct	30 ms	5496 KB	Output is correct
33	Correct	34 ms	6744 KB	Output is correct
34	Correct	36 ms	7500 KB	Output is correct
35	Correct	34 ms	6704 KB	Output is correct
36	Correct	30 ms	4952 KB	Output is correct
37	Correct	32 ms	6536 KB	Output is correct
38	Correct	32 ms	6048 KB	Output is correct
39	Correct	31 ms	6492 KB	Output is correct
40	Correct	30 ms	5716 KB	Output is correct
41	Correct	26 ms	3920 KB	Output is correct
42	Correct	25 ms	4116 KB	Output is correct
43	Correct	33 ms	6728 KB	Output is correct
44	Correct	35 ms	6224 KB	Output is correct
45	Correct	28 ms	5200 KB	Output is correct
46	Correct	64 ms	15444 KB	Output is correct
47	Correct	75 ms	19284 KB	Output is correct
48	Correct	80 ms	26140 KB	Output is correct
49	Correct	132 ms	41336 KB	Output is correct
50	Correct	114 ms	41292 KB	Output is correct

Subtask #3
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	464 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	456 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	1 ms	504 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	604 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	460 KB	Output is correct
36	Correct	0 ms	600 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	0 ms	456 KB	Output is correct
39	Correct	0 ms	344 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	344 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	1 ms	348 KB	Output is correct

Subtask #4
62.0 / 62.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	464 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	456 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	5 ms	1408 KB	Output is correct
29	Correct	18 ms	4188 KB	Output is correct
30	Correct	20 ms	3776 KB	Output is correct
31	Correct	121 ms	33620 KB	Output is correct
32	Correct	30 ms	5496 KB	Output is correct
33	Correct	34 ms	6744 KB	Output is correct
34	Correct	36 ms	7500 KB	Output is correct
35	Correct	34 ms	6704 KB	Output is correct
36	Correct	30 ms	4952 KB	Output is correct
37	Correct	32 ms	6536 KB	Output is correct
38	Correct	32 ms	6048 KB	Output is correct
39	Correct	31 ms	6492 KB	Output is correct
40	Correct	30 ms	5716 KB	Output is correct
41	Correct	26 ms	3920 KB	Output is correct
42	Correct	25 ms	4116 KB	Output is correct
43	Correct	33 ms	6728 KB	Output is correct
44	Correct	35 ms	6224 KB	Output is correct
45	Correct	28 ms	5200 KB	Output is correct
46	Correct	64 ms	15444 KB	Output is correct
47	Correct	75 ms	19284 KB	Output is correct
48	Correct	80 ms	26140 KB	Output is correct
49	Correct	132 ms	41336 KB	Output is correct
50	Correct	114 ms	41292 KB	Output is correct
51	Correct	0 ms	344 KB	Output is correct
52	Correct	1 ms	504 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	604 KB	Output is correct
55	Correct	1 ms	348 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	0 ms	460 KB	Output is correct
61	Correct	0 ms	600 KB	Output is correct
62	Correct	1 ms	348 KB	Output is correct
63	Correct	0 ms	456 KB	Output is correct
64	Correct	0 ms	344 KB	Output is correct
65	Correct	1 ms	348 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	0 ms	348 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	0 ms	348 KB	Output is correct
71	Correct	1 ms	348 KB	Output is correct
72	Correct	0 ms	348 KB	Output is correct
73	Correct	0 ms	344 KB	Output is correct
74	Correct	0 ms	348 KB	Output is correct
75	Correct	1 ms	348 KB	Output is correct
76	Correct	3 ms	712 KB	Output is correct
77	Correct	3 ms	860 KB	Output is correct
78	Correct	17 ms	6028 KB	Output is correct
79	Correct	65 ms	19316 KB	Output is correct
80	Correct	27 ms	4316 KB	Output is correct
81	Correct	40 ms	6996 KB	Output is correct
82	Correct	37 ms	5588 KB	Output is correct
83	Correct	26 ms	3164 KB	Output is correct
84	Correct	35 ms	6228 KB	Output is correct
85	Correct	33 ms	6156 KB	Output is correct
86	Correct	105 ms	27852 KB	Output is correct
87	Correct	36 ms	7760 KB	Output is correct
88	Correct	32 ms	5200 KB	Output is correct
89	Correct	34 ms	5716 KB	Output is correct
90	Correct	33 ms	6736 KB	Output is correct
91	Correct	34 ms	6736 KB	Output is correct
92	Correct	34 ms	6748 KB	Output is correct
93	Correct	36 ms	7252 KB	Output is correct
94	Correct	34 ms	4692 KB	Output is correct
95	Correct	29 ms	4956 KB	Output is correct
96	Correct	77 ms	15400 KB	Output is correct
97	Correct	82 ms	19284 KB	Output is correct
98	Correct	97 ms	25408 KB	Output is correct
99	Correct	139 ms	41240 KB	Output is correct
100	Correct	95 ms	26424 KB	Output is correct

답안 #927204

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 23.0 / 23.0

Subtask #4 62.0 / 62.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
23.0 / 23.0

Subtask #4
62.0 / 62.0