Submission #84174

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
84174	2018-11-13T20:47:28 Z	nikolapesic2802	Garbage (POI11_smi)	C++14	60 / 100	3000 ms	133960 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<pair<int,int> > > graf(N);
vector<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(int i=0;i<graf[tr].size();i++)
    {
        if(!visited[tr][i])
        {
            int p=graf[tr][i].first;
            int j=graf[tr][i].second;
            visited[tr][i]=1;
            visited[p][j]=1;
            degree[tr]--;
            degree[p]--;
            solve(p);
            return;
        }
    }
}
void fastscan(int &number)
{
    register int c;
    number = 0;
    c = getchar();
    for (; (c>47 && c<58); c=getchar())
        number = number *10 + c - 48;
}
int main()
{
    /*int n=1e5,m=1e6;
    //scanf("%i %i",&n,&m);
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<10;j++){
        int a=i,b=(i+j)%n+1,s=1,t=0;
        //scanf("%i %i %i %i",&a,&b,&s,&t);
        if(s!=t)
        {
            graf[a].pb(b);
            graf[b].pb(a);
            degree[a]++;
            degree[b]++;
        }
        }
    }*/
    int n,m;
    //scanf("%i %i",&n,&m);
    fastscan(n);
    fastscan(m);
    for(int i=0;i<m;i++)
    {
        int a,b,s,t;
        fastscan(a);
        fastscan(b);
        fastscan(s);
        fastscan(t);
        //scanf("%i %i %i %i",&a,&b,&s,&t);
        if(s!=t)
        {
            graf[a].pb({b,graf[b].size()});
            graf[b].pb({a,graf[a].size()-1});
            visited[a].pb(0);
            visited[b].pb(0);
            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("%d\n",sol.size());
    for(auto p:sol)
    {
        printf("%d ",p.size()-1);
        for(auto d:p)
        {
            printf("%d ",d);
        }
        printf("\n");
    }
    return 0;
}

Compilation message

smi.cpp: In function 'void solve(int)':
smi.cpp:34:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<graf[tr].size();i++)
                 ~^~~~~~~~~~~~~~~~
smi.cpp: In function 'int main()':
smi.cpp:116:29: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<std::vector<int> >::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n",sol.size());
                   ~~~~~~~~~~^
smi.cpp:119:32: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
         printf("%d ",p.size()-1);
                      ~~~~~~~~~~^

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	5752 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	6004 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	6052 KB	Output is correct
2	Correct	7 ms	6052 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	6532 KB	Output is correct
2	Correct	7 ms	6532 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	6532 KB	Output is correct
2	Correct	7 ms	6532 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	7472 KB	Output is correct
2	Correct	9 ms	7472 KB	Output is correct

Subtask #7
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	81 ms	19756 KB	Output is correct
2	Execution timed out	3021 ms	89916 KB	Time limit exceeded

Subtask #8
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	668 ms	89916 KB	Output is correct
2	Execution timed out	3059 ms	89916 KB	Time limit exceeded

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1222 ms	118200 KB	Output is correct
2	Execution timed out	3053 ms	118200 KB	Time limit exceeded

Subtask #10
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1657 ms	133960 KB	Output is correct
2	Execution timed out	3046 ms	133960 KB	Time limit exceeded