oj.uz

Submission #594154

# Submission time Handle Problem Language Result Execution time Memory
594154 2022-07-12T07:17:08 Z 조영욱(#8434) None (JOI16_ho_t4) C++17
100 / 100
 117 ms 10884 KB 
#include <bits/stdc++.h>
using namespace std;

int n,k;
char str[100001];
typedef pair<long long,long long> P;
typedef pair<P,P> PP;

long long f(long long a,long long b) {
    if (b==0) {
        return 0;
    }
    long long ret=a%abs(b);
    if (ret<0) {
        ret+=abs(b);
    }
    return ret;
}

int main() {
    scanf("%d %d",&n,&k);
    scanf("%s",str);
    long long ret=0;
    set<P> s;
    s.insert(P(0,0));
    int x=0;
    int y=0;
        for(int i=0;i<n;i++) {
            if (str[i]=='E') {
                x++;
            }
            if (str[i]=='W') {
                x--;
            }
            if (str[i]=='N') {
                y++;
            }
            if (str[i]=='S') {
                y--;
            }
            s.insert(P(x,y));
        }
    long long a=x;
    long long b=y;
    if (a==0&&b==0) {
        int ret=0;
        for(auto now:s) {
            bool flag=true;
            for(int i=1;i<4;i++) {
                if (s.find(P(now.first+i/2,now.second+i%2))==s.end()) {
                    flag=false;
                    break;
                }
            }
            if (flag) {
                ret++;
            }
        }
        printf("%d",ret);
        return 0;
    }
    vector<PP> vec;
    for(auto now:s) {
        long long x=now.first;
        long long y=now.second;
        vec.push_back(PP(P(f(x,a),f(y,b)),P(-b*x+a*y,a*x+b*y)));
    }
    sort(vec.begin(),vec.end());
    for(auto now:s) {
        long long x=now.first;
        long long y=now.second;
        auto iter=upper_bound(vec.begin(),vec.end(),PP(P(f(x,a),f(y,b)),P(-b*x+a*y,a*x+b*y)));
        vector<P> v;
        v.push_back(P(1,0));
        if (iter!=vec.end()&&(*iter).first==P(f(x,a),f(y,b))&&(*iter).second.first==-b*x+a*y) {
            long long val=(*iter).second.second-(a*x+b*y);
            val/=a*a+b*b;
            v.push_back(P(val+1,-1));
            //printf(".%d %d %d\n",x,y,val);
        }
        v.push_back(P(k+1,-1));
        for(int i=1;i<4;i++) {
            long long nx=now.first+i/2;
            long long ny=now.second+i%2;
            auto iter=lower_bound(vec.begin(),vec.end(),PP(P(f(nx,a),f(ny,b)),P(-b*nx+a*ny,a*nx+b*ny)));
            long long lo=0;
            long long hi=k+1;
            if (iter!=vec.end()&&(*iter).first==P(f(nx,a),f(ny,b))&&(*iter).second.first==-b*nx+a*ny) {
                long long val=(*iter).second.second-(a*nx+b*ny);
                if (val==0) {
                    continue;
                }
                val/=a*a+b*b;
                hi=val+1;
            }
            if (iter!=vec.begin()) {
                iter--;
                if ((*iter).first==P(f(nx,a),f(ny,b))&&(*iter).second.first==-b*nx+a*ny) {
                    long long val=(a*nx+b*ny)-(*iter).second.second;
                    val/=a*a+b*b;
                    lo=k-val;
                }
            }
            if (lo+1>=hi) {
                continue;
            }
            v.push_back(P(lo+1,-1));
            v.push_back(P(hi,1));
        }
        sort(v.begin(),v.end());
        int sum=0;
        for(int i=0;i+1<v.size();i++) {
            sum+=v[i].second;
            if (sum>=0) {
                ret+=v[i+1].first-v[i].first;
            }
        }
        //printf("%d %d %d\n",x,y,ret);
    }
    printf("%lld",ret);
    return 0;
}

Compilation message

2016_ho_t4.cpp: In function 'int main()':
2016_ho_t4.cpp:112:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |         for(int i=0;i+1<v.size();i++) {
      |                     ~~~^~~~~~~~~
2016_ho_t4.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d %d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~~
2016_ho_t4.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%s",str);
      |     ~~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 220 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 220 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 13 ms 1880 KB Output is correct
30 Correct 18 ms 1872 KB Output is correct
31 Correct 95 ms 9904 KB Output is correct
32 Correct 17 ms 1656 KB Output is correct
33 Correct 32 ms 3068 KB Output is correct
34 Correct 33 ms 3188 KB Output is correct
35 Correct 34 ms 3052 KB Output is correct
36 Correct 26 ms 2892 KB Output is correct
37 Correct 17 ms 1864 KB Output is correct
38 Correct 23 ms 2976 KB Output is correct
39 Correct 27 ms 3020 KB Output is correct
40 Correct 15 ms 1708 KB Output is correct
41 Correct 31 ms 2764 KB Output is correct
42 Correct 18 ms 1988 KB Output is correct
43 Correct 29 ms 3148 KB Output is correct
44 Correct 26 ms 2896 KB Output is correct
45 Correct 18 ms 2724 KB Output is correct
46 Correct 59 ms 5696 KB Output is correct
47 Correct 52 ms 5676 KB Output is correct
48 Correct 86 ms 10820 KB Output is correct
49 Correct 111 ms 10836 KB Output is correct
50 Correct 108 ms 10880 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 220 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 232 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct

Subtask #4
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 220 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 13 ms 1880 KB Output is correct
30 Correct 18 ms 1872 KB Output is correct
31 Correct 95 ms 9904 KB Output is correct
32 Correct 17 ms 1656 KB Output is correct
33 Correct 32 ms 3068 KB Output is correct
34 Correct 33 ms 3188 KB Output is correct
35 Correct 34 ms 3052 KB Output is correct
36 Correct 26 ms 2892 KB Output is correct
37 Correct 17 ms 1864 KB Output is correct
38 Correct 23 ms 2976 KB Output is correct
39 Correct 27 ms 3020 KB Output is correct
40 Correct 15 ms 1708 KB Output is correct
41 Correct 31 ms 2764 KB Output is correct
42 Correct 18 ms 1988 KB Output is correct
43 Correct 29 ms 3148 KB Output is correct
44 Correct 26 ms 2896 KB Output is correct
45 Correct 18 ms 2724 KB Output is correct
46 Correct 59 ms 5696 KB Output is correct
47 Correct 52 ms 5676 KB Output is correct
48 Correct 86 ms 10820 KB Output is correct
49 Correct 111 ms 10836 KB Output is correct
50 Correct 108 ms 10880 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 232 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 2 ms 468 KB Output is correct
77 Correct 3 ms 340 KB Output is correct
78 Correct 16 ms 2640 KB Output is correct
79 Correct 45 ms 5456 KB Output is correct
80 Correct 22 ms 2644 KB Output is correct
81 Correct 18 ms 1876 KB Output is correct
82 Correct 23 ms 2852 KB Output is correct
83 Correct 20 ms 2000 KB Output is correct
84 Correct 36 ms 2988 KB Output is correct
85 Correct 29 ms 3020 KB Output is correct
86 Correct 84 ms 10884 KB Output is correct
87 Correct 30 ms 3236 KB Output is correct
88 Correct 39 ms 2816 KB Output is correct
89 Correct 23 ms 2900 KB Output is correct
90 Correct 18 ms 1876 KB Output is correct
91 Correct 27 ms 3024 KB Output is correct
92 Correct 31 ms 3044 KB Output is correct
93 Correct 38 ms 3148 KB Output is correct
94 Correct 24 ms 2620 KB Output is correct
95 Correct 21 ms 2768 KB Output is correct
96 Correct 52 ms 5696 KB Output is correct
97 Correct 50 ms 5708 KB Output is correct
98 Correct 86 ms 10812 KB Output is correct
99 Correct 117 ms 10820 KB Output is correct
100 Correct 90 ms 10820 KB Output is correct