oj.uz

답안 #1119256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1119256 2024-11-26T17:42:57 Z modwwe Board Game (JOI24_boardgame) C++17
100 / 100
 3116 ms 23980 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||x.c>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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3408 KB Output is correct
2 Correct 34 ms 14392 KB Output is correct
3 Correct 57 ms 22744 KB Output is correct
4 Correct 733 ms 20576 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3152 KB Output is correct
2 Correct 49 ms 14344 KB Output is correct
3 Correct 1584 ms 20768 KB Output is correct
4 Correct 67 ms 20632 KB Output is correct
5 Correct 73 ms 22016 KB Output is correct
6 Correct 130 ms 20696 KB Output is correct
7 Correct 219 ms 17440 KB Output is correct
8 Correct 68 ms 19404 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3208 KB Output is correct
2 Correct 38 ms 14364 KB Output is correct
3 Correct 680 ms 22480 KB Output is correct
4 Correct 107 ms 21796 KB Output is correct
5 Correct 61 ms 22516 KB Output is correct
6 Correct 87 ms 20584 KB Output is correct
7 Correct 294 ms 20812 KB Output is correct
8 Correct 66 ms 22364 KB Output is correct
9 Correct 32 ms 9192 KB Output is correct
10 Correct 45 ms 12372 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2908 KB Output is correct
2 Correct 7 ms 3164 KB Output is correct
3 Correct 4 ms 3328 KB Output is correct
4 Correct 21 ms 3420 KB Output is correct
5 Correct 12 ms 2656 KB Output is correct
6 Correct 8 ms 2652 KB Output is correct
7 Correct 5 ms 2656 KB Output is correct
8 Correct 6 ms 3176 KB Output is correct
9 Correct 5 ms 2832 KB Output is correct
10 Correct 6 ms 2988 KB Output is correct
11 Correct 5 ms 2896 KB Output is correct
12 Correct 5 ms 2908 KB Output is correct
13 Correct 9 ms 3044 KB Output is correct
14 Correct 5 ms 3152 KB Output is correct
15 Correct 23 ms 3152 KB Output is correct
16 Correct 59 ms 3168 KB Output is correct
17 Correct 101 ms 3204 KB Output is correct
18 Correct 5 ms 3152 KB Output is correct
19 Correct 8 ms 3324 KB Output is correct
20 Correct 35 ms 3172 KB Output is correct
21 Correct 5 ms 3152 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 20600 KB Output is correct
2 Correct 64 ms 20896 KB Output is correct
3 Correct 48 ms 20744 KB Output is correct
4 Correct 97 ms 20964 KB Output is correct
5 Correct 74 ms 20716 KB Output is correct
6 Correct 50 ms 17224 KB Output is correct
7 Correct 74 ms 11760 KB Output is correct
8 Correct 29 ms 10796 KB Output is correct
9 Correct 30 ms 11080 KB Output is correct
10 Correct 46 ms 17112 KB Output is correct
11 Correct 44 ms 17288 KB Output is correct
12 Correct 57 ms 20296 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 20600 KB Output is correct
2 Correct 64 ms 20896 KB Output is correct
3 Correct 48 ms 20744 KB Output is correct
4 Correct 97 ms 20964 KB Output is correct
5 Correct 74 ms 20716 KB Output is correct
6 Correct 50 ms 17224 KB Output is correct
7 Correct 74 ms 11760 KB Output is correct
8 Correct 29 ms 10796 KB Output is correct
9 Correct 30 ms 11080 KB Output is correct
10 Correct 46 ms 17112 KB Output is correct
11 Correct 44 ms 17288 KB Output is correct
12 Correct 57 ms 20296 KB Output is correct
13 Correct 173 ms 20700 KB Output is correct
14 Correct 280 ms 21884 KB Output is correct
15 Correct 1214 ms 22132 KB Output is correct
16 Correct 986 ms 20916 KB Output is correct
17 Correct 856 ms 18636 KB Output is correct
18 Correct 787 ms 19432 KB Output is correct
19 Correct 1398 ms 20040 KB Output is correct
20 Correct 752 ms 20924 KB Output is correct
21 Correct 39 ms 11472 KB Output is correct
22 Correct 195 ms 12856 KB Output is correct
23 Correct 430 ms 12948 KB Output is correct
24 Correct 68 ms 18304 KB Output is correct
25 Correct 366 ms 20124 KB Output is correct
26 Correct 659 ms 20136 KB Output is correct
27 Correct 43 ms 13132 KB Output is correct
28 Correct 250 ms 12972 KB Output is correct
29 Correct 494 ms 13024 KB Output is correct
30 Correct 89 ms 20388 KB Output is correct
31 Correct 409 ms 20408 KB Output is correct
32 Correct 781 ms 20348 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2908 KB Output is correct
2 Correct 7 ms 3164 KB Output is correct
3 Correct 4 ms 3328 KB Output is correct
4 Correct 21 ms 3420 KB Output is correct
5 Correct 12 ms 2656 KB Output is correct
6 Correct 8 ms 2652 KB Output is correct
7 Correct 5 ms 2656 KB Output is correct
8 Correct 6 ms 3176 KB Output is correct
9 Correct 5 ms 2832 KB Output is correct
10 Correct 6 ms 2988 KB Output is correct
11 Correct 5 ms 2896 KB Output is correct
12 Correct 5 ms 2908 KB Output is correct
13 Correct 9 ms 3044 KB Output is correct
14 Correct 5 ms 3152 KB Output is correct
15 Correct 23 ms 3152 KB Output is correct
16 Correct 59 ms 3168 KB Output is correct
17 Correct 101 ms 3204 KB Output is correct
18 Correct 5 ms 3152 KB Output is correct
19 Correct 8 ms 3324 KB Output is correct
20 Correct 35 ms 3172 KB Output is correct
21 Correct 5 ms 3152 KB Output is correct
22 Correct 80 ms 13384 KB Output is correct
23 Correct 170 ms 14952 KB Output is correct
24 Correct 49 ms 13384 KB Output is correct
25 Correct 1129 ms 13428 KB Output is correct
26 Correct 117 ms 13896 KB Output is correct
27 Correct 34 ms 14068 KB Output is correct
28 Correct 95 ms 13948 KB Output is correct
29 Correct 27 ms 14284 KB Output is correct
30 Correct 54 ms 13392 KB Output is correct
31 Correct 35 ms 14252 KB Output is correct
32 Correct 1029 ms 9840 KB Output is correct
33 Correct 33 ms 10936 KB Output is correct
34 Correct 554 ms 13092 KB Output is correct
35 Correct 777 ms 13128 KB Output is correct
36 Correct 168 ms 13920 KB Output is correct
37 Correct 150 ms 13640 KB Output is correct
38 Correct 104 ms 13616 KB Output is correct
39 Correct 737 ms 12992 KB Output is correct
40 Correct 970 ms 13000 KB Output is correct
41 Correct 93 ms 13700 KB Output is correct
42 Correct 82 ms 13688 KB Output is correct
43 Correct 63 ms 13720 KB Output is correct
44 Correct 56 ms 13756 KB Output is correct
45 Correct 47 ms 13824 KB Output is correct
46 Correct 40 ms 13904 KB Output is correct
47 Correct 34 ms 13752 KB Output is correct
48 Correct 53 ms 13880 KB Output is correct
49 Correct 34 ms 13904 KB Output is correct
50 Correct 30 ms 13904 KB Output is correct
51 Correct 35 ms 13044 KB Output is correct
52 Correct 53 ms 13108 KB Output is correct
53 Correct 458 ms 13044 KB Output is correct
54 Correct 43 ms 15164 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3408 KB Output is correct
2 Correct 34 ms 14392 KB Output is correct
3 Correct 57 ms 22744 KB Output is correct
4 Correct 733 ms 20576 KB Output is correct
5 Correct 6 ms 3152 KB Output is correct
6 Correct 49 ms 14344 KB Output is correct
7 Correct 1584 ms 20768 KB Output is correct
8 Correct 67 ms 20632 KB Output is correct
9 Correct 73 ms 22016 KB Output is correct
10 Correct 130 ms 20696 KB Output is correct
11 Correct 219 ms 17440 KB Output is correct
12 Correct 68 ms 19404 KB Output is correct
13 Correct 5 ms 3208 KB Output is correct
14 Correct 38 ms 14364 KB Output is correct
15 Correct 680 ms 22480 KB Output is correct
16 Correct 107 ms 21796 KB Output is correct
17 Correct 61 ms 22516 KB Output is correct
18 Correct 87 ms 20584 KB Output is correct
19 Correct 294 ms 20812 KB Output is correct
20 Correct 66 ms 22364 KB Output is correct
21 Correct 32 ms 9192 KB Output is correct
22 Correct 45 ms 12372 KB Output is correct
23 Correct 5 ms 2908 KB Output is correct
24 Correct 7 ms 3164 KB Output is correct
25 Correct 4 ms 3328 KB Output is correct
26 Correct 21 ms 3420 KB Output is correct
27 Correct 12 ms 2656 KB Output is correct
28 Correct 8 ms 2652 KB Output is correct
29 Correct 5 ms 2656 KB Output is correct
30 Correct 6 ms 3176 KB Output is correct
31 Correct 5 ms 2832 KB Output is correct
32 Correct 6 ms 2988 KB Output is correct
33 Correct 5 ms 2896 KB Output is correct
34 Correct 5 ms 2908 KB Output is correct
35 Correct 9 ms 3044 KB Output is correct
36 Correct 5 ms 3152 KB Output is correct
37 Correct 23 ms 3152 KB Output is correct
38 Correct 59 ms 3168 KB Output is correct
39 Correct 101 ms 3204 KB Output is correct
40 Correct 5 ms 3152 KB Output is correct
41 Correct 8 ms 3324 KB Output is correct
42 Correct 35 ms 3172 KB Output is correct
43 Correct 5 ms 3152 KB Output is correct
44 Correct 86 ms 20600 KB Output is correct
45 Correct 64 ms 20896 KB Output is correct
46 Correct 48 ms 20744 KB Output is correct
47 Correct 97 ms 20964 KB Output is correct
48 Correct 74 ms 20716 KB Output is correct
49 Correct 50 ms 17224 KB Output is correct
50 Correct 74 ms 11760 KB Output is correct
51 Correct 29 ms 10796 KB Output is correct
52 Correct 30 ms 11080 KB Output is correct
53 Correct 46 ms 17112 KB Output is correct
54 Correct 44 ms 17288 KB Output is correct
55 Correct 57 ms 20296 KB Output is correct
56 Correct 173 ms 20700 KB Output is correct
57 Correct 280 ms 21884 KB Output is correct
58 Correct 1214 ms 22132 KB Output is correct
59 Correct 986 ms 20916 KB Output is correct
60 Correct 856 ms 18636 KB Output is correct
61 Correct 787 ms 19432 KB Output is correct
62 Correct 1398 ms 20040 KB Output is correct
63 Correct 752 ms 20924 KB Output is correct
64 Correct 39 ms 11472 KB Output is correct
65 Correct 195 ms 12856 KB Output is correct
66 Correct 430 ms 12948 KB Output is correct
67 Correct 68 ms 18304 KB Output is correct
68 Correct 366 ms 20124 KB Output is correct
69 Correct 659 ms 20136 KB Output is correct
70 Correct 43 ms 13132 KB Output is correct
71 Correct 250 ms 12972 KB Output is correct
72 Correct 494 ms 13024 KB Output is correct
73 Correct 89 ms 20388 KB Output is correct
74 Correct 409 ms 20408 KB Output is correct
75 Correct 781 ms 20348 KB Output is correct
76 Correct 80 ms 13384 KB Output is correct
77 Correct 170 ms 14952 KB Output is correct
78 Correct 49 ms 13384 KB Output is correct
79 Correct 1129 ms 13428 KB Output is correct
80 Correct 117 ms 13896 KB Output is correct
81 Correct 34 ms 14068 KB Output is correct
82 Correct 95 ms 13948 KB Output is correct
83 Correct 27 ms 14284 KB Output is correct
84 Correct 54 ms 13392 KB Output is correct
85 Correct 35 ms 14252 KB Output is correct
86 Correct 1029 ms 9840 KB Output is correct
87 Correct 33 ms 10936 KB Output is correct
88 Correct 554 ms 13092 KB Output is correct
89 Correct 777 ms 13128 KB Output is correct
90 Correct 168 ms 13920 KB Output is correct
91 Correct 150 ms 13640 KB Output is correct
92 Correct 104 ms 13616 KB Output is correct
93 Correct 737 ms 12992 KB Output is correct
94 Correct 970 ms 13000 KB Output is correct
95 Correct 93 ms 13700 KB Output is correct
96 Correct 82 ms 13688 KB Output is correct
97 Correct 63 ms 13720 KB Output is correct
98 Correct 56 ms 13756 KB Output is correct
99 Correct 47 ms 13824 KB Output is correct
100 Correct 40 ms 13904 KB Output is correct
101 Correct 34 ms 13752 KB Output is correct
102 Correct 53 ms 13880 KB Output is correct
103 Correct 34 ms 13904 KB Output is correct
104 Correct 30 ms 13904 KB Output is correct
105 Correct 35 ms 13044 KB Output is correct
106 Correct 53 ms 13108 KB Output is correct
107 Correct 458 ms 13044 KB Output is correct
108 Correct 43 ms 15164 KB Output is correct
109 Correct 203 ms 22288 KB Output is correct
110 Correct 1042 ms 23188 KB Output is correct
111 Correct 2364 ms 20604 KB Output is correct
112 Correct 1324 ms 20832 KB Output is correct
113 Correct 391 ms 21572 KB Output is correct
114 Correct 783 ms 23696 KB Output is correct
115 Correct 2841 ms 20776 KB Output is correct
116 Correct 3116 ms 21104 KB Output is correct
117 Correct 843 ms 21452 KB Output is correct
118 Correct 70 ms 10752 KB Output is correct
119 Correct 88 ms 11332 KB Output is correct
120 Correct 169 ms 19960 KB Output is correct
121 Correct 61 ms 23980 KB Output is correct
122 Correct 1303 ms 20504 KB Output is correct
123 Correct 385 ms 22084 KB Output is correct
124 Correct 323 ms 21828 KB Output is correct
125 Correct 251 ms 21692 KB Output is correct
126 Correct 1561 ms 20516 KB Output is correct
127 Correct 1799 ms 20508 KB Output is correct
128 Correct 287 ms 21832 KB Output is correct
129 Correct 163 ms 21832 KB Output is correct
130 Correct 154 ms 21832 KB Output is correct
131 Correct 130 ms 21776 KB Output is correct
132 Correct 116 ms 21664 KB Output is correct
133 Correct 115 ms 21832 KB Output is correct
134 Correct 81 ms 21672 KB Output is correct
135 Correct 83 ms 21608 KB Output is correct
136 Correct 73 ms 21648 KB Output is correct
137 Correct 69 ms 21576 KB Output is correct
138 Correct 52 ms 21780 KB Output is correct
139 Correct 61 ms 21892 KB Output is correct
140 Correct 44 ms 20308 KB Output is correct
141 Correct 117 ms 20348 KB Output is correct
142 Correct 140 ms 21628 KB Output is correct
143 Correct 60 ms 23940 KB Output is correct