Submission #84160

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
84160	2018-11-13T20:02:13 Z	nikolapesic2802	Garbage (POI11_smi)	C++14	60 / 100	3000 ms	236520 KB

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
const int N=1e5+5;
vector<int> degree(N);
vector<vector<int> > graf(N);
map<int,int> visited[N];
vector<vector<int> > sol;
stack<int> stk;
vector<int> vis(N);
void solve(int tr)
{
    //printf("Usao za %i\n",tr);
    vis[tr]++;
    stk.push(tr);
    if(vis[tr]==2)
    {
        vector<int> t;
        t.pb(tr);
        vis[tr]--;
        stk.pop();
        while(stk.top()!=tr)
        {
            t.pb(stk.top());
            vis[stk.top()]--;
            stk.pop();
        }
        t.pb(stk.top());
        sol.pb(t);
    }
    for(auto p:graf[tr])
    {
        if(!visited[tr][p])
        {
            visited[tr][p]=1;
            visited[p][tr]=1;
            degree[tr]--;
            degree[p]--;
            solve(p);
            return;
        }
    }
}
int main()
{
    int n,m;
    scanf("%i %i",&n,&m);
    for(int i=0;i<m;i++)
    {
        int a,b,s,t;
        scanf("%i %i %i %i",&a,&b,&s,&t);
        if(s!=t)
        {
            graf[a].pb(b);
            graf[b].pb(a);
            degree[a]++;
            degree[b]++;
            //printf("Dodajem iz %i u %i\n",a,b);
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(degree[i]%2==1)
        {
            printf("NIE\n");
            return 0;
        }
    }
    for(int i=1;i<=n;i++)
    {
        while(degree[i]!=0)
        {
            while(stk.size())
                stk.pop();
            solve(i);
            vis[i]--;
        }
    }
    printf("%i\n",sol.size());
    for(auto p:sol)
    {
        printf("%i ",p.size()-1);
        set<int> v;
        for(auto d:p)
        {
            if(v.count(d)&&d!=p[0])
            {
                //assert(false);
            }
            v.insert(d);
            printf("%i ",d);
        }
        printf("\n");
    }
    return 0;
}

Compilation message

smi.cpp: In function 'int main()':
smi.cpp:82:29: warning: format '%i' expects argument of type 'int', but argument 2 has type 'std::vector<std::vector<int> >::size_type {aka long unsigned int}' [-Wformat=]
     printf("%i\n",sol.size());
                   ~~~~~~~~~~^
smi.cpp:85:32: warning: format '%i' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
         printf("%i ",p.size()-1);
                      ~~~~~~~~~~^
smi.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i %i",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~
smi.cpp:54:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i %i %i %i",&a,&b,&s,&t);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	8184 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	8316 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	8464 KB	Output is correct
2	Correct	12 ms	8464 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	9188 KB	Output is correct
2	Correct	10 ms	9188 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	9188 KB	Output is correct
2	Correct	10 ms	9188 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	10616 KB	Output is correct
2	Correct	15 ms	10616 KB	Output is correct

Subtask #7
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	268 ms	29560 KB	Output is correct
2	Execution timed out	3030 ms	41320 KB	Time limit exceeded

Subtask #8
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1696 ms	128964 KB	Output is correct
2	Execution timed out	3060 ms	128964 KB	Time limit exceeded

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2684 ms	198796 KB	Output is correct
2	Execution timed out	3032 ms	198796 KB	Time limit exceeded

Subtask #10
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	3040 ms	236520 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-