oj.uz

Submission #740310

# Submission time Handle Problem Language Result Execution time Memory
740310 2023-05-12T09:47:41 Z bgnbvnbv Senior Postmen (BOI14_postmen) C++14
100 / 100
 488 ms 43940 KB 
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=int;
const ll maxN=5e5+10;
const ll inf=1e18;
const ll mod=1e9+7;
ll n,m;
struct qdge
{
    ll u,v;
}e[maxN];
vector<ll>g[maxN];
bool ex[maxN],in[maxN];
ll deg[maxN];
ll pre[maxN],nxt[maxN];
void xoa(ll x)
{
    pre[nxt[x]]=pre[x];
    nxt[pre[x]]=nxt[x];
}
vector<ll>q;
void solve()
{
    cin >> n >> m;
    for(int i=1;i<=m;i++)
    {
        cin >> e[i].u >> e[i].v;
        g[e[i].u].pb(i);
        g[e[i].v].pb(i);
        ex[i]=true;
        deg[e[i].u]++;
        deg[e[i].v]++;
    }
    nxt[0]=1;
    pre[n+1]=n;
    for(int i=1;i<=n;i++) in[i]=false,pre[i]=i-1,nxt[i]=i+1;
    while(nxt[0]!=n+1)
    {
        q.pb(nxt[0]);
        in[nxt[0]]=true;
        while(q.size()>0)
        {
            ll u=q.back();
            while(g[u].size()>0&&ex[g[u].back()]==false) g[u].pop_back();
            if(g[u].size()>0)
            {
                ll id=g[u].back();
                ll v=u^e[id].u^e[id].v;
                ex[id]=false;
                if(in[v]==true)
                {
                    while(true)
                    {
                        ll x=q.back();
                        q.pop_back();
                        cout << x<<' ';
                        deg[x]-=2;
                        if(deg[x]==0) xoa(x);
                        in[x]=false;
                        if(x==v)
                        {
                            if(q.size()>0)
                            {
                                in[v]=true;
                                q.pb(x);
                            }
                            break;
                        }
                    }
                    cout << '\n';
                }
                else
                {
                    in[v]=true;
                    q.push_back(v);
                }
            }
        }
    }
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Compilation message

postmen.cpp:11:14: warning: overflow in conversion from 'double' to 'll' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   11 | const ll inf=1e18;
      |              ^~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 8 ms 12244 KB Output is correct
5 Correct 6 ms 12048 KB Output is correct
6 Correct 7 ms 12116 KB Output is correct
7 Correct 10 ms 12500 KB Output is correct
8 Correct 7 ms 12240 KB Output is correct
9 Correct 33 ms 14272 KB Output is correct
10 Correct 7 ms 12244 KB Output is correct
11 Correct 10 ms 12116 KB Output is correct
12 Correct 37 ms 14492 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11988 KB Output is correct
2 Correct 6 ms 12104 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 12160 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 12 ms 12236 KB Output is correct
7 Correct 10 ms 12508 KB Output is correct
8 Correct 6 ms 12116 KB Output is correct
9 Correct 31 ms 14336 KB Output is correct
10 Correct 7 ms 12244 KB Output is correct
11 Correct 8 ms 12116 KB Output is correct
12 Correct 46 ms 14480 KB Output is correct
13 Correct 50 ms 18392 KB Output is correct
14 Correct 53 ms 16876 KB Output is correct
15 Correct 56 ms 16656 KB Output is correct
16 Correct 64 ms 18484 KB Output is correct
17 Correct 79 ms 16660 KB Output is correct
18 Correct 78 ms 16992 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 8 ms 11988 KB Output is correct
3 Correct 7 ms 12036 KB Output is correct
4 Correct 10 ms 12244 KB Output is correct
5 Correct 8 ms 12116 KB Output is correct
6 Correct 9 ms 12112 KB Output is correct
7 Correct 16 ms 12524 KB Output is correct
8 Correct 8 ms 12192 KB Output is correct
9 Correct 39 ms 14352 KB Output is correct
10 Correct 8 ms 12244 KB Output is correct
11 Correct 11 ms 12164 KB Output is correct
12 Correct 44 ms 14588 KB Output is correct
13 Correct 92 ms 18388 KB Output is correct
14 Correct 49 ms 16848 KB Output is correct
15 Correct 56 ms 16632 KB Output is correct
16 Correct 80 ms 18436 KB Output is correct
17 Correct 68 ms 16592 KB Output is correct
18 Correct 49 ms 17100 KB Output is correct
19 Correct 438 ms 43844 KB Output is correct
20 Correct 373 ms 36380 KB Output is correct
21 Correct 399 ms 35184 KB Output is correct
22 Correct 457 ms 43940 KB Output is correct
23 Correct 134 ms 22940 KB Output is correct
24 Correct 488 ms 35544 KB Output is correct
25 Correct 426 ms 43384 KB Output is correct