oj.uz

Submission #31544

# Submission time Handle Problem Language Result Execution time Memory
31544 2017-08-29T08:04:10 Z Kanvie Senior Postmen (BOI14_postmen) C++14
38 / 100
 500 ms 16812 KB 
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef pair<int,int> pii;
int n,m,vv,u,cnt;
vector<pair<int,int> >v[500001];
bool visit[500001],fi,edge[500001];
vector<int>ans;
stack<int>s;
bool chk(int x)
{
    if(!edge[x]){edge[x]=true;return true;}
    else return false;
}
int x,y;
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i)
    {
        scanf("%d%d",&x,&y);
        ++cnt;
        v[x].push_back({y,cnt});
        v[y].push_back({x,cnt});
    }
    s.push(1);
    while(!s.empty())
    {
        u=s.top();
        for(int i=0;i<v[u].size();++i)
        {
            vv=v[u][i].fi;
            if(chk(v[u][i].se))break;
            if(i==v[u].size()-1)vv=-1;
        }
        if(vv!=-1)s.push(vv);
        else {s.pop();ans.push_back(u);}
    }
    fi=false;
    //for(int i=0;i<ans.size();++i)cout<<ans[i]<<' ';cout<<endl;
    for(int i=0;i<ans.size();++i)
    {
        if(!visit[ans[i]])
        {
            s.push(ans[i]);
            visit[ans[i]]=true;
        }
        else
        {
            if(fi)printf("\n");
            else fi=true;
            while(1)
            {
                if(s.top()!=ans[i])printf("%d ",s.top());
                else printf("%d",s.top());
                if(s.top()!=ans[i]){visit[s.top()]=false;s.pop();}
                else break;
            }
        }
    }
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:31:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<v[u].size();++i)
                     ~^~~~~~~~~~~~
postmen.cpp:35:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(i==v[u].size()-1)vv=-1;
                ~^~~~~~~~~~~~~~~
postmen.cpp:42:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<ans.size();++i)
                 ~^~~~~~~~~~~
postmen.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
postmen.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x,&y);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12032 KB Output is correct
2 Correct 13 ms 12032 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 19 ms 12232 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 16 ms 12288 KB Output is correct
7 Correct 30 ms 12776 KB Output is correct
8 Correct 15 ms 12160 KB Output is correct
9 Correct 161 ms 15136 KB Output is correct
10 Correct 13 ms 12160 KB Output is correct
11 Correct 16 ms 12160 KB Output is correct
12 Correct 88 ms 15460 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12044 KB Output is correct
4 Correct 16 ms 12264 KB Output is correct
5 Correct 14 ms 12160 KB Output is correct
6 Correct 14 ms 12288 KB Output is correct
7 Correct 22 ms 12800 KB Output is correct
8 Correct 13 ms 12160 KB Output is correct
9 Correct 172 ms 15140 KB Output is correct
10 Correct 17 ms 12288 KB Output is correct
11 Correct 13 ms 12248 KB Output is correct
12 Correct 145 ms 15520 KB Output is correct
13 Correct 134 ms 16788 KB Output is correct
14 Correct 110 ms 16272 KB Output is correct
15 Execution timed out 1092 ms 15372 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12008 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 15 ms 12288 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 15 ms 12288 KB Output is correct
7 Correct 24 ms 12688 KB Output is correct
8 Correct 12 ms 12160 KB Output is correct
9 Correct 148 ms 15196 KB Output is correct
10 Correct 14 ms 12160 KB Output is correct
11 Correct 15 ms 12160 KB Output is correct
12 Correct 87 ms 15428 KB Output is correct
13 Correct 98 ms 16812 KB Output is correct
14 Correct 91 ms 16388 KB Output is correct
15 Execution timed out 1085 ms 15392 KB Time limit exceeded
16 Halted 0 ms 0 KB -