oj.uz

답안 #1119260

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1119260 2024-11-26T17:44:53 Z modwwe Board Game (JOI24_boardgame) C++17
100 / 100
 1540 ms 33956 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][501];

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<=100)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 4 ms 6016 KB Output is correct
2 Correct 37 ms 21452 KB Output is correct
3 Correct 64 ms 32940 KB Output is correct
4 Correct 684 ms 30504 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3664 KB Output is correct
2 Correct 45 ms 20308 KB Output is correct
3 Correct 1356 ms 32224 KB Output is correct
4 Correct 67 ms 31100 KB Output is correct
5 Correct 57 ms 32156 KB Output is correct
6 Correct 121 ms 30536 KB Output is correct
7 Correct 188 ms 25064 KB Output is correct
8 Correct 68 ms 30080 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3716 KB Output is correct
2 Correct 36 ms 20212 KB Output is correct
3 Correct 733 ms 32168 KB Output is correct
4 Correct 126 ms 31492 KB Output is correct
5 Correct 84 ms 32392 KB Output is correct
6 Correct 111 ms 30336 KB Output is correct
7 Correct 245 ms 30372 KB Output is correct
8 Correct 67 ms 32304 KB Output is correct
9 Correct 26 ms 11088 KB Output is correct
10 Correct 60 ms 14164 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3152 KB Output is correct
2 Correct 8 ms 3812 KB Output is correct
3 Correct 5 ms 3664 KB Output is correct
4 Correct 24 ms 4088 KB Output is correct
5 Correct 10 ms 3152 KB Output is correct
6 Correct 9 ms 3008 KB Output is correct
7 Correct 5 ms 3036 KB Output is correct
8 Correct 5 ms 3712 KB Output is correct
9 Correct 5 ms 3408 KB Output is correct
10 Correct 5 ms 3408 KB Output is correct
11 Correct 5 ms 3408 KB Output is correct
12 Correct 6 ms 3408 KB Output is correct
13 Correct 9 ms 3400 KB Output is correct
14 Correct 6 ms 3664 KB Output is correct
15 Correct 20 ms 3664 KB Output is correct
16 Correct 39 ms 3764 KB Output is correct
17 Correct 7 ms 3732 KB Output is correct
18 Correct 6 ms 3716 KB Output is correct
19 Correct 6 ms 3664 KB Output is correct
20 Correct 34 ms 3716 KB Output is correct
21 Correct 7 ms 3920 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 30472 KB Output is correct
2 Correct 55 ms 30784 KB Output is correct
3 Correct 52 ms 30280 KB Output is correct
4 Correct 80 ms 30676 KB Output is correct
5 Correct 72 ms 30536 KB Output is correct
6 Correct 44 ms 25160 KB Output is correct
7 Correct 52 ms 13552 KB Output is correct
8 Correct 31 ms 15176 KB Output is correct
9 Correct 26 ms 15440 KB Output is correct
10 Correct 51 ms 24648 KB Output is correct
11 Correct 43 ms 24492 KB Output is correct
12 Correct 49 ms 30276 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 30472 KB Output is correct
2 Correct 55 ms 30784 KB Output is correct
3 Correct 52 ms 30280 KB Output is correct
4 Correct 80 ms 30676 KB Output is correct
5 Correct 72 ms 30536 KB Output is correct
6 Correct 44 ms 25160 KB Output is correct
7 Correct 52 ms 13552 KB Output is correct
8 Correct 31 ms 15176 KB Output is correct
9 Correct 26 ms 15440 KB Output is correct
10 Correct 51 ms 24648 KB Output is correct
11 Correct 43 ms 24492 KB Output is correct
12 Correct 49 ms 30276 KB Output is correct
13 Correct 119 ms 30344 KB Output is correct
14 Correct 232 ms 31476 KB Output is correct
15 Correct 1131 ms 32160 KB Output is correct
16 Correct 965 ms 30696 KB Output is correct
17 Correct 976 ms 26652 KB Output is correct
18 Correct 906 ms 27248 KB Output is correct
19 Correct 1381 ms 27196 KB Output is correct
20 Correct 805 ms 30628 KB Output is correct
21 Correct 45 ms 16284 KB Output is correct
22 Correct 220 ms 18716 KB Output is correct
23 Correct 392 ms 18760 KB Output is correct
24 Correct 71 ms 26440 KB Output is correct
25 Correct 334 ms 29624 KB Output is correct
26 Correct 672 ms 30132 KB Output is correct
27 Correct 39 ms 18768 KB Output is correct
28 Correct 206 ms 18760 KB Output is correct
29 Correct 484 ms 18792 KB Output is correct
30 Correct 76 ms 30060 KB Output is correct
31 Correct 421 ms 30300 KB Output is correct
32 Correct 1025 ms 30112 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3152 KB Output is correct
2 Correct 8 ms 3812 KB Output is correct
3 Correct 5 ms 3664 KB Output is correct
4 Correct 24 ms 4088 KB Output is correct
5 Correct 10 ms 3152 KB Output is correct
6 Correct 9 ms 3008 KB Output is correct
7 Correct 5 ms 3036 KB Output is correct
8 Correct 5 ms 3712 KB Output is correct
9 Correct 5 ms 3408 KB Output is correct
10 Correct 5 ms 3408 KB Output is correct
11 Correct 5 ms 3408 KB Output is correct
12 Correct 6 ms 3408 KB Output is correct
13 Correct 9 ms 3400 KB Output is correct
14 Correct 6 ms 3664 KB Output is correct
15 Correct 20 ms 3664 KB Output is correct
16 Correct 39 ms 3764 KB Output is correct
17 Correct 7 ms 3732 KB Output is correct
18 Correct 6 ms 3716 KB Output is correct
19 Correct 6 ms 3664 KB Output is correct
20 Correct 34 ms 3716 KB Output is correct
21 Correct 7 ms 3920 KB Output is correct
22 Correct 93 ms 19096 KB Output is correct
23 Correct 189 ms 20852 KB Output is correct
24 Correct 56 ms 19216 KB Output is correct
25 Correct 193 ms 19572 KB Output is correct
26 Correct 118 ms 19784 KB Output is correct
27 Correct 39 ms 20092 KB Output is correct
28 Correct 98 ms 19688 KB Output is correct
29 Correct 32 ms 20180 KB Output is correct
30 Correct 58 ms 19272 KB Output is correct
31 Correct 38 ms 20176 KB Output is correct
32 Correct 114 ms 14296 KB Output is correct
33 Correct 38 ms 14936 KB Output is correct
34 Correct 285 ms 20300 KB Output is correct
35 Correct 242 ms 20352 KB Output is correct
36 Correct 193 ms 19784 KB Output is correct
37 Correct 116 ms 19528 KB Output is correct
38 Correct 111 ms 19468 KB Output is correct
39 Correct 221 ms 19688 KB Output is correct
40 Correct 128 ms 19784 KB Output is correct
41 Correct 96 ms 19784 KB Output is correct
42 Correct 85 ms 19748 KB Output is correct
43 Correct 72 ms 19588 KB Output is correct
44 Correct 53 ms 19740 KB Output is correct
45 Correct 68 ms 19568 KB Output is correct
46 Correct 46 ms 19632 KB Output is correct
47 Correct 43 ms 19592 KB Output is correct
48 Correct 48 ms 19576 KB Output is correct
49 Correct 45 ms 19580 KB Output is correct
50 Correct 38 ms 19892 KB Output is correct
51 Correct 36 ms 18768 KB Output is correct
52 Correct 48 ms 18836 KB Output is correct
53 Correct 461 ms 18960 KB Output is correct
54 Correct 42 ms 21072 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6016 KB Output is correct
2 Correct 37 ms 21452 KB Output is correct
3 Correct 64 ms 32940 KB Output is correct
4 Correct 684 ms 30504 KB Output is correct
5 Correct 5 ms 3664 KB Output is correct
6 Correct 45 ms 20308 KB Output is correct
7 Correct 1356 ms 32224 KB Output is correct
8 Correct 67 ms 31100 KB Output is correct
9 Correct 57 ms 32156 KB Output is correct
10 Correct 121 ms 30536 KB Output is correct
11 Correct 188 ms 25064 KB Output is correct
12 Correct 68 ms 30080 KB Output is correct
13 Correct 7 ms 3716 KB Output is correct
14 Correct 36 ms 20212 KB Output is correct
15 Correct 733 ms 32168 KB Output is correct
16 Correct 126 ms 31492 KB Output is correct
17 Correct 84 ms 32392 KB Output is correct
18 Correct 111 ms 30336 KB Output is correct
19 Correct 245 ms 30372 KB Output is correct
20 Correct 67 ms 32304 KB Output is correct
21 Correct 26 ms 11088 KB Output is correct
22 Correct 60 ms 14164 KB Output is correct
23 Correct 6 ms 3152 KB Output is correct
24 Correct 8 ms 3812 KB Output is correct
25 Correct 5 ms 3664 KB Output is correct
26 Correct 24 ms 4088 KB Output is correct
27 Correct 10 ms 3152 KB Output is correct
28 Correct 9 ms 3008 KB Output is correct
29 Correct 5 ms 3036 KB Output is correct
30 Correct 5 ms 3712 KB Output is correct
31 Correct 5 ms 3408 KB Output is correct
32 Correct 5 ms 3408 KB Output is correct
33 Correct 5 ms 3408 KB Output is correct
34 Correct 6 ms 3408 KB Output is correct
35 Correct 9 ms 3400 KB Output is correct
36 Correct 6 ms 3664 KB Output is correct
37 Correct 20 ms 3664 KB Output is correct
38 Correct 39 ms 3764 KB Output is correct
39 Correct 7 ms 3732 KB Output is correct
40 Correct 6 ms 3716 KB Output is correct
41 Correct 6 ms 3664 KB Output is correct
42 Correct 34 ms 3716 KB Output is correct
43 Correct 7 ms 3920 KB Output is correct
44 Correct 67 ms 30472 KB Output is correct
45 Correct 55 ms 30784 KB Output is correct
46 Correct 52 ms 30280 KB Output is correct
47 Correct 80 ms 30676 KB Output is correct
48 Correct 72 ms 30536 KB Output is correct
49 Correct 44 ms 25160 KB Output is correct
50 Correct 52 ms 13552 KB Output is correct
51 Correct 31 ms 15176 KB Output is correct
52 Correct 26 ms 15440 KB Output is correct
53 Correct 51 ms 24648 KB Output is correct
54 Correct 43 ms 24492 KB Output is correct
55 Correct 49 ms 30276 KB Output is correct
56 Correct 119 ms 30344 KB Output is correct
57 Correct 232 ms 31476 KB Output is correct
58 Correct 1131 ms 32160 KB Output is correct
59 Correct 965 ms 30696 KB Output is correct
60 Correct 976 ms 26652 KB Output is correct
61 Correct 906 ms 27248 KB Output is correct
62 Correct 1381 ms 27196 KB Output is correct
63 Correct 805 ms 30628 KB Output is correct
64 Correct 45 ms 16284 KB Output is correct
65 Correct 220 ms 18716 KB Output is correct
66 Correct 392 ms 18760 KB Output is correct
67 Correct 71 ms 26440 KB Output is correct
68 Correct 334 ms 29624 KB Output is correct
69 Correct 672 ms 30132 KB Output is correct
70 Correct 39 ms 18768 KB Output is correct
71 Correct 206 ms 18760 KB Output is correct
72 Correct 484 ms 18792 KB Output is correct
73 Correct 76 ms 30060 KB Output is correct
74 Correct 421 ms 30300 KB Output is correct
75 Correct 1025 ms 30112 KB Output is correct
76 Correct 93 ms 19096 KB Output is correct
77 Correct 189 ms 20852 KB Output is correct
78 Correct 56 ms 19216 KB Output is correct
79 Correct 193 ms 19572 KB Output is correct
80 Correct 118 ms 19784 KB Output is correct
81 Correct 39 ms 20092 KB Output is correct
82 Correct 98 ms 19688 KB Output is correct
83 Correct 32 ms 20180 KB Output is correct
84 Correct 58 ms 19272 KB Output is correct
85 Correct 38 ms 20176 KB Output is correct
86 Correct 114 ms 14296 KB Output is correct
87 Correct 38 ms 14936 KB Output is correct
88 Correct 285 ms 20300 KB Output is correct
89 Correct 242 ms 20352 KB Output is correct
90 Correct 193 ms 19784 KB Output is correct
91 Correct 116 ms 19528 KB Output is correct
92 Correct 111 ms 19468 KB Output is correct
93 Correct 221 ms 19688 KB Output is correct
94 Correct 128 ms 19784 KB Output is correct
95 Correct 96 ms 19784 KB Output is correct
96 Correct 85 ms 19748 KB Output is correct
97 Correct 72 ms 19588 KB Output is correct
98 Correct 53 ms 19740 KB Output is correct
99 Correct 68 ms 19568 KB Output is correct
100 Correct 46 ms 19632 KB Output is correct
101 Correct 43 ms 19592 KB Output is correct
102 Correct 48 ms 19576 KB Output is correct
103 Correct 45 ms 19580 KB Output is correct
104 Correct 38 ms 19892 KB Output is correct
105 Correct 36 ms 18768 KB Output is correct
106 Correct 48 ms 18836 KB Output is correct
107 Correct 461 ms 18960 KB Output is correct
108 Correct 42 ms 21072 KB Output is correct
109 Correct 224 ms 31904 KB Output is correct
110 Correct 824 ms 32960 KB Output is correct
111 Correct 1479 ms 32244 KB Output is correct
112 Correct 987 ms 31400 KB Output is correct
113 Correct 528 ms 31148 KB Output is correct
114 Correct 1217 ms 33460 KB Output is correct
115 Correct 1540 ms 32212 KB Output is correct
116 Correct 814 ms 31616 KB Output is correct
117 Correct 812 ms 29272 KB Output is correct
118 Correct 75 ms 12540 KB Output is correct
119 Correct 101 ms 13188 KB Output is correct
120 Correct 197 ms 27312 KB Output is correct
121 Correct 59 ms 33956 KB Output is correct
122 Correct 538 ms 33036 KB Output is correct
123 Correct 302 ms 31912 KB Output is correct
124 Correct 248 ms 31380 KB Output is correct
125 Correct 168 ms 31304 KB Output is correct
126 Correct 472 ms 31316 KB Output is correct
127 Correct 404 ms 31556 KB Output is correct
128 Correct 280 ms 31596 KB Output is correct
129 Correct 209 ms 31536 KB Output is correct
130 Correct 179 ms 31468 KB Output is correct
131 Correct 156 ms 31560 KB Output is correct
132 Correct 156 ms 31692 KB Output is correct
133 Correct 154 ms 31464 KB Output is correct
134 Correct 110 ms 31560 KB Output is correct
135 Correct 111 ms 31472 KB Output is correct
136 Correct 86 ms 31580 KB Output is correct
137 Correct 73 ms 31356 KB Output is correct
138 Correct 82 ms 31484 KB Output is correct
139 Correct 74 ms 31772 KB Output is correct
140 Correct 60 ms 30296 KB Output is correct
141 Correct 110 ms 30184 KB Output is correct
142 Correct 150 ms 31452 KB Output is correct
143 Correct 80 ms 33652 KB Output is correct