oj.uz

Submission #1119253

# Submission time Handle Problem Language Result Execution time Memory
1119253 2024-11-26T17:40:46 Z modwwe Board Game (JOI24_boardgame) C++17
100 / 100
 2909 ms 24020 KB 
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
#define int  long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
}
void phongbeo();
const int inf = 1e10;
const ll mod2 = 1e9 + 7;
const int  mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0)x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,t,lim,w,l,r ;
int kk;
int el = 19;
main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo();
    // checktime
}
string s;
vector<int> v[50001];
int ans[50001];
int c[50001];
int d[50001];
int cost[50001];
int vis[50001];
int a[50001];
vector<int> cd;
struct cmp
{
    bool operator()(id a,id b)
    {
        return a.a>b.a;
    }
};
void bfs(int c[],bool k)
{
    deque<ib>q;
    for(int i=1; i<=n; i++)
        if(s[i-1]=='1')
        {
            if(k)
            {
                for(auto f:v[i])
                    if(s[f-1]=='1')
                    {
                        q.pb({0,i});
                    }
            }
            else
            {
                q.pb({0,i});
            }
        }
    while(!q.empty())
    {
        ib x=q.front();
        q.pop_front();
        if(vis[x.b]) continue;
        vis[x.b]=1;
        for(auto f:v[x.b])
        {
            c[f]=min(x.a+1,c[f]);
            if(s[f-1]=='1')q.push_front({x.a,f});
            else q.push_back({x.a+1,f});
        }
    }
}
bool cc[50001][301];

namespace k_low
{
priority_queue<id,vector<id>,cmp>p;
void solve()
{
    sort(cd.begin(),cd.end());
    int total=0;
    for(int i=0; i<k; i++)
    {
        p.push({total+s4,s9,i,0});
        cost[i]=i+(k-i-1)*2;
        total+=cd[i];
    }
    while(!p.empty())
    {
        id x=p.top();
        p.pop();
        if(cc[x.b][x.c]) continue;
        cc[x.b][x.c]=1;
        if(x.d)
        {
            ans[x.b]=min(ans[x.b],x.a);
        }
        for(auto f:v[x.b])
            if(s[f-1]=='1')
            {
                if(x.d)
                    ans[f]=min(ans[f],x.a+1);
                p.push({x.a+cost[x.c]+1,f,x.c,1});
            }
            else
            {
                p.push({x.a+1,f,x.c,x.d});
            }
    }
    p.push({0,s9,0,0});
    ans[s9]=0;
    while(!p.empty())
    {
        id x=p.top();
        p.pop();
        if(vis[x.b]) continue;
        vis[x.b]=1;
        for(auto f:v[x.b])
        {
            ans[f]=min(ans[f],x.a+1);
            if(s[f-1]=='0') p.push({x.a+1,f,x.c,x.d});
        }
    }
}
};
namespace k_high
{
int pre[50001];
int cur[50001];
void solve()
{
    for(int i=2; i<=k; i++)
    {
        l=a[i];
        int ci=c[l];
        int di=d[l];
        if(c[l]==0) c[l]+=2;
        if(d[l]==0) d[l]=1;
        c[l]-=2;
        d[l]--;
        if(d[l]+1==inf)
        {
            pre[1]+=c[l];
            cur[1]+=2;
        }
        else
        {
            s3=d[l]-c[l];
            pre[s3]+=d[l];
            pre[s3]-=c[l];
            pre[1]+=c[l];
            cur[s3]++;
            cur[s3]-=2;
            cur[1]+=2;
            pre[s3]-=(s3-1);
        }
        c[l]=ci;
        d[l]=di;

    }
    for(int i=1; i<=n; i++)
        cur[i]+=cur[i-1],
                pre[i]+=pre[i-1]+cur[i];
    deque<ic> q;
    q.push_front({0,s9});
    memset(vis,-1,sizeof vis);
    while(!q.empty())
    {
        ic x=q.front();
        q.pop_front();
        if(vis[x.b]!=-1) continue;
        vis[x.b]=x.a;
        for(auto f:v[x.b])
            if(s[f-1]=='1') q.pb({x.a+1,f});
            else q.push_front({x.a,f});
    }

    q.pb({0,s9,0});
    while(!q.empty())
    {
        ic x=q.front();
        q.pop_front();
        s8=max(s8,x.c);
        if((x.c-vis[x.b])*(k-1)>=n) continue;
        if(cc[x.b][x.c-vis[x.b]]) continue;
        cc[x.b][x.c-vis[x.b]]=1;
        if(s[x.b-1]=='1')s4=1;
        else s4=0;
        ans[x.b]=min(ans[x.b],x.a+pre[x.c-s4]);
        for(auto f:v[x.b])
            if(s[f-1]=='1')q.pb({x.a+1,f,x.c+1});
            else q.pb({x.a+1,f,x.c});
    }
        memset(vis,0,sizeof vis);
}
};
void phongbeo()
{
    cin>>n>>m>>k;
    for(int i=1; i<=m; i++)
        cin>>l>>r,v[l].pb(r),v[r].pb(l);
    cin>>s;
    for(int i=1; i<=n; i++)
        d[i]=inf,c[i]=inf;
    bfs(c,0);
    memset(vis,0,sizeof vis);
    bfs(d,1);
    memset(vis,0,sizeof vis);
    for(int i=1; i<=k; i++)
    {
        cin>>l;
        int ci=c[l];
        int di=d[l];
        if(c[l]==0) c[l]+=2;
        if(d[l]==0) d[l]=1;
        if(i==1)s9=l;
        else c[l]-=2,d[l]--,cd.pb(d[l]-c[l]),s4+=c[l];
        a[i]=l;
        c[l]=ci;
        d[l]=di;
    }
    for(int i=1; i<=n; i++)
        ans[i]=inf;
    if(k<=250)k_low::solve();
    else k_high::solve();
    for(int i=1; i<=n; i++)
        cout<<ans[i]<<" ";
}

Compilation message

Main.cpp:75:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   75 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:79:9: note: in expansion of macro 'fin'
   79 |         fin(task);
      |         ^~~
Main.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:80:9: note: in expansion of macro 'fou'
   80 |         fou(task);
      |         ^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3152 KB Output is correct
2 Correct 44 ms 14016 KB Output is correct
3 Correct 61 ms 21960 KB Output is correct
4 Correct 745 ms 20632 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3408 KB Output is correct
2 Correct 39 ms 14276 KB Output is correct
3 Correct 1371 ms 20660 KB Output is correct
4 Correct 56 ms 20880 KB Output is correct
5 Correct 72 ms 22284 KB Output is correct
6 Correct 123 ms 20752 KB Output is correct
7 Correct 155 ms 17364 KB Output is correct
8 Correct 60 ms 19420 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3152 KB Output is correct
2 Correct 39 ms 14356 KB Output is correct
3 Correct 731 ms 22444 KB Output is correct
4 Correct 109 ms 21944 KB Output is correct
5 Correct 61 ms 22528 KB Output is correct
6 Correct 92 ms 20572 KB Output is correct
7 Correct 245 ms 20644 KB Output is correct
8 Correct 70 ms 22488 KB Output is correct
9 Correct 33 ms 9008 KB Output is correct
10 Correct 58 ms 12368 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2640 KB Output is correct
2 Correct 7 ms 3152 KB Output is correct
3 Correct 7 ms 3152 KB Output is correct
4 Correct 22 ms 3408 KB Output is correct
5 Correct 11 ms 2876 KB Output is correct
6 Correct 9 ms 2692 KB Output is correct
7 Correct 5 ms 2640 KB Output is correct
8 Correct 5 ms 3152 KB Output is correct
9 Correct 6 ms 2952 KB Output is correct
10 Correct 5 ms 2896 KB Output is correct
11 Correct 6 ms 2792 KB Output is correct
12 Correct 6 ms 2896 KB Output is correct
13 Correct 9 ms 3152 KB Output is correct
14 Correct 6 ms 3152 KB Output is correct
15 Correct 24 ms 3048 KB Output is correct
16 Correct 49 ms 3152 KB Output is correct
17 Correct 107 ms 3204 KB Output is correct
18 Correct 6 ms 2896 KB Output is correct
19 Correct 8 ms 3152 KB Output is correct
20 Correct 36 ms 3152 KB Output is correct
21 Correct 7 ms 3564 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 19972 KB Output is correct
2 Correct 72 ms 20836 KB Output is correct
3 Correct 48 ms 20564 KB Output is correct
4 Correct 97 ms 20328 KB Output is correct
5 Correct 99 ms 20540 KB Output is correct
6 Correct 65 ms 16668 KB Output is correct
7 Correct 50 ms 11760 KB Output is correct
8 Correct 26 ms 10680 KB Output is correct
9 Correct 24 ms 10912 KB Output is correct
10 Correct 52 ms 16680 KB Output is correct
11 Correct 53 ms 16712 KB Output is correct
12 Correct 63 ms 20444 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 19972 KB Output is correct
2 Correct 72 ms 20836 KB Output is correct
3 Correct 48 ms 20564 KB Output is correct
4 Correct 97 ms 20328 KB Output is correct
5 Correct 99 ms 20540 KB Output is correct
6 Correct 65 ms 16668 KB Output is correct
7 Correct 50 ms 11760 KB Output is correct
8 Correct 26 ms 10680 KB Output is correct
9 Correct 24 ms 10912 KB Output is correct
10 Correct 52 ms 16680 KB Output is correct
11 Correct 53 ms 16712 KB Output is correct
12 Correct 63 ms 20444 KB Output is correct
13 Correct 168 ms 20040 KB Output is correct
14 Correct 297 ms 21780 KB Output is correct
15 Correct 1050 ms 21832 KB Output is correct
16 Correct 759 ms 20236 KB Output is correct
17 Correct 711 ms 18252 KB Output is correct
18 Correct 595 ms 19264 KB Output is correct
19 Correct 834 ms 19624 KB Output is correct
20 Correct 635 ms 20416 KB Output is correct
21 Correct 32 ms 11088 KB Output is correct
22 Correct 183 ms 12612 KB Output is correct
23 Correct 347 ms 12616 KB Output is correct
24 Correct 69 ms 17720 KB Output is correct
25 Correct 344 ms 19516 KB Output is correct
26 Correct 728 ms 19600 KB Output is correct
27 Correct 52 ms 12976 KB Output is correct
28 Correct 193 ms 12680 KB Output is correct
29 Correct 391 ms 13124 KB Output is correct
30 Correct 77 ms 19732 KB Output is correct
31 Correct 402 ms 19892 KB Output is correct
32 Correct 966 ms 19752 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2640 KB Output is correct
2 Correct 7 ms 3152 KB Output is correct
3 Correct 7 ms 3152 KB Output is correct
4 Correct 22 ms 3408 KB Output is correct
5 Correct 11 ms 2876 KB Output is correct
6 Correct 9 ms 2692 KB Output is correct
7 Correct 5 ms 2640 KB Output is correct
8 Correct 5 ms 3152 KB Output is correct
9 Correct 6 ms 2952 KB Output is correct
10 Correct 5 ms 2896 KB Output is correct
11 Correct 6 ms 2792 KB Output is correct
12 Correct 6 ms 2896 KB Output is correct
13 Correct 9 ms 3152 KB Output is correct
14 Correct 6 ms 3152 KB Output is correct
15 Correct 24 ms 3048 KB Output is correct
16 Correct 49 ms 3152 KB Output is correct
17 Correct 107 ms 3204 KB Output is correct
18 Correct 6 ms 2896 KB Output is correct
19 Correct 8 ms 3152 KB Output is correct
20 Correct 36 ms 3152 KB Output is correct
21 Correct 7 ms 3564 KB Output is correct
22 Correct 83 ms 13216 KB Output is correct
23 Correct 203 ms 14872 KB Output is correct
24 Correct 64 ms 13384 KB Output is correct
25 Correct 1389 ms 13244 KB Output is correct
26 Correct 132 ms 13776 KB Output is correct
27 Correct 38 ms 14068 KB Output is correct
28 Correct 96 ms 14072 KB Output is correct
29 Correct 33 ms 14204 KB Output is correct
30 Correct 55 ms 13392 KB Output is correct
31 Correct 36 ms 14324 KB Output is correct
32 Correct 1099 ms 9836 KB Output is correct
33 Correct 38 ms 11088 KB Output is correct
34 Correct 560 ms 13056 KB Output is correct
35 Correct 838 ms 13180 KB Output is correct
36 Correct 156 ms 13912 KB Output is correct
37 Correct 120 ms 13740 KB Output is correct
38 Correct 86 ms 13620 KB Output is correct
39 Correct 697 ms 12964 KB Output is correct
40 Correct 1108 ms 13012 KB Output is correct
41 Correct 119 ms 13820 KB Output is correct
42 Correct 85 ms 13992 KB Output is correct
43 Correct 70 ms 13936 KB Output is correct
44 Correct 65 ms 13764 KB Output is correct
45 Correct 61 ms 13688 KB Output is correct
46 Correct 44 ms 13908 KB Output is correct
47 Correct 43 ms 13752 KB Output is correct
48 Correct 39 ms 13848 KB Output is correct
49 Correct 46 ms 13880 KB Output is correct
50 Correct 35 ms 14008 KB Output is correct
51 Correct 32 ms 13120 KB Output is correct
52 Correct 54 ms 13128 KB Output is correct
53 Correct 398 ms 13136 KB Output is correct
54 Correct 34 ms 15240 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3152 KB Output is correct
2 Correct 44 ms 14016 KB Output is correct
3 Correct 61 ms 21960 KB Output is correct
4 Correct 745 ms 20632 KB Output is correct
5 Correct 7 ms 3408 KB Output is correct
6 Correct 39 ms 14276 KB Output is correct
7 Correct 1371 ms 20660 KB Output is correct
8 Correct 56 ms 20880 KB Output is correct
9 Correct 72 ms 22284 KB Output is correct
10 Correct 123 ms 20752 KB Output is correct
11 Correct 155 ms 17364 KB Output is correct
12 Correct 60 ms 19420 KB Output is correct
13 Correct 5 ms 3152 KB Output is correct
14 Correct 39 ms 14356 KB Output is correct
15 Correct 731 ms 22444 KB Output is correct
16 Correct 109 ms 21944 KB Output is correct
17 Correct 61 ms 22528 KB Output is correct
18 Correct 92 ms 20572 KB Output is correct
19 Correct 245 ms 20644 KB Output is correct
20 Correct 70 ms 22488 KB Output is correct
21 Correct 33 ms 9008 KB Output is correct
22 Correct 58 ms 12368 KB Output is correct
23 Correct 6 ms 2640 KB Output is correct
24 Correct 7 ms 3152 KB Output is correct
25 Correct 7 ms 3152 KB Output is correct
26 Correct 22 ms 3408 KB Output is correct
27 Correct 11 ms 2876 KB Output is correct
28 Correct 9 ms 2692 KB Output is correct
29 Correct 5 ms 2640 KB Output is correct
30 Correct 5 ms 3152 KB Output is correct
31 Correct 6 ms 2952 KB Output is correct
32 Correct 5 ms 2896 KB Output is correct
33 Correct 6 ms 2792 KB Output is correct
34 Correct 6 ms 2896 KB Output is correct
35 Correct 9 ms 3152 KB Output is correct
36 Correct 6 ms 3152 KB Output is correct
37 Correct 24 ms 3048 KB Output is correct
38 Correct 49 ms 3152 KB Output is correct
39 Correct 107 ms 3204 KB Output is correct
40 Correct 6 ms 2896 KB Output is correct
41 Correct 8 ms 3152 KB Output is correct
42 Correct 36 ms 3152 KB Output is correct
43 Correct 7 ms 3564 KB Output is correct
44 Correct 103 ms 19972 KB Output is correct
45 Correct 72 ms 20836 KB Output is correct
46 Correct 48 ms 20564 KB Output is correct
47 Correct 97 ms 20328 KB Output is correct
48 Correct 99 ms 20540 KB Output is correct
49 Correct 65 ms 16668 KB Output is correct
50 Correct 50 ms 11760 KB Output is correct
51 Correct 26 ms 10680 KB Output is correct
52 Correct 24 ms 10912 KB Output is correct
53 Correct 52 ms 16680 KB Output is correct
54 Correct 53 ms 16712 KB Output is correct
55 Correct 63 ms 20444 KB Output is correct
56 Correct 168 ms 20040 KB Output is correct
57 Correct 297 ms 21780 KB Output is correct
58 Correct 1050 ms 21832 KB Output is correct
59 Correct 759 ms 20236 KB Output is correct
60 Correct 711 ms 18252 KB Output is correct
61 Correct 595 ms 19264 KB Output is correct
62 Correct 834 ms 19624 KB Output is correct
63 Correct 635 ms 20416 KB Output is correct
64 Correct 32 ms 11088 KB Output is correct
65 Correct 183 ms 12612 KB Output is correct
66 Correct 347 ms 12616 KB Output is correct
67 Correct 69 ms 17720 KB Output is correct
68 Correct 344 ms 19516 KB Output is correct
69 Correct 728 ms 19600 KB Output is correct
70 Correct 52 ms 12976 KB Output is correct
71 Correct 193 ms 12680 KB Output is correct
72 Correct 391 ms 13124 KB Output is correct
73 Correct 77 ms 19732 KB Output is correct
74 Correct 402 ms 19892 KB Output is correct
75 Correct 966 ms 19752 KB Output is correct
76 Correct 83 ms 13216 KB Output is correct
77 Correct 203 ms 14872 KB Output is correct
78 Correct 64 ms 13384 KB Output is correct
79 Correct 1389 ms 13244 KB Output is correct
80 Correct 132 ms 13776 KB Output is correct
81 Correct 38 ms 14068 KB Output is correct
82 Correct 96 ms 14072 KB Output is correct
83 Correct 33 ms 14204 KB Output is correct
84 Correct 55 ms 13392 KB Output is correct
85 Correct 36 ms 14324 KB Output is correct
86 Correct 1099 ms 9836 KB Output is correct
87 Correct 38 ms 11088 KB Output is correct
88 Correct 560 ms 13056 KB Output is correct
89 Correct 838 ms 13180 KB Output is correct
90 Correct 156 ms 13912 KB Output is correct
91 Correct 120 ms 13740 KB Output is correct
92 Correct 86 ms 13620 KB Output is correct
93 Correct 697 ms 12964 KB Output is correct
94 Correct 1108 ms 13012 KB Output is correct
95 Correct 119 ms 13820 KB Output is correct
96 Correct 85 ms 13992 KB Output is correct
97 Correct 70 ms 13936 KB Output is correct
98 Correct 65 ms 13764 KB Output is correct
99 Correct 61 ms 13688 KB Output is correct
100 Correct 44 ms 13908 KB Output is correct
101 Correct 43 ms 13752 KB Output is correct
102 Correct 39 ms 13848 KB Output is correct
103 Correct 46 ms 13880 KB Output is correct
104 Correct 35 ms 14008 KB Output is correct
105 Correct 32 ms 13120 KB Output is correct
106 Correct 54 ms 13128 KB Output is correct
107 Correct 398 ms 13136 KB Output is correct
108 Correct 34 ms 15240 KB Output is correct
109 Correct 171 ms 22240 KB Output is correct
110 Correct 648 ms 23268 KB Output is correct
111 Correct 2122 ms 20604 KB Output is correct
112 Correct 1401 ms 20876 KB Output is correct
113 Correct 432 ms 21544 KB Output is correct
114 Correct 1166 ms 23936 KB Output is correct
115 Correct 2700 ms 20696 KB Output is correct
116 Correct 2909 ms 21072 KB Output is correct
117 Correct 680 ms 21452 KB Output is correct
118 Correct 64 ms 10752 KB Output is correct
119 Correct 83 ms 11148 KB Output is correct
120 Correct 157 ms 19716 KB Output is correct
121 Correct 60 ms 23964 KB Output is correct
122 Correct 1215 ms 20548 KB Output is correct
123 Correct 376 ms 22208 KB Output is correct
124 Correct 256 ms 21740 KB Output is correct
125 Correct 203 ms 21668 KB Output is correct
126 Correct 1382 ms 20300 KB Output is correct
127 Correct 1675 ms 20516 KB Output is correct
128 Correct 251 ms 21636 KB Output is correct
129 Correct 161 ms 21836 KB Output is correct
130 Correct 130 ms 21836 KB Output is correct
131 Correct 103 ms 21812 KB Output is correct
132 Correct 108 ms 21804 KB Output is correct
133 Correct 105 ms 21836 KB Output is correct
134 Correct 84 ms 21836 KB Output is correct
135 Correct 82 ms 21772 KB Output is correct
136 Correct 75 ms 21836 KB Output is correct
137 Correct 62 ms 21608 KB Output is correct
138 Correct 70 ms 21580 KB Output is correct
139 Correct 60 ms 22140 KB Output is correct
140 Correct 52 ms 20300 KB Output is correct
141 Correct 103 ms 20552 KB Output is correct
142 Correct 124 ms 21564 KB Output is correct
143 Correct 64 ms 24020 KB Output is correct