Submission #860362

#	Time	Username	Problem	Language	Result	Execution time	Memory
860362		jamkel	Teoretičar (COCI18_teoreticar)	C++14	26 / 130	12030 ms	262144 KiB

teoreticar

#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
typedef long long ll;
ll l,r,m;
ll kol=1;

map<pair<int,int>,int>ma;
void dfs(int g,vector<vector<int>>&b,vector<pair<int,int>>&a,vector<pair<int,int>>&j,vector<pair<int,int>>&d,int &c, vector<vector<int>>&czy)
{//cout<<"AAA"<<endl;
    for(int i=0;i<b[g].size();i++)
    {
        while(czy[min(g,b[g][i])][max(g,b[g][i])]>0)
        {
            czy[min(g,b[g][i])][max(g,b[g][i])]--;
            dfs(b[g][i],b,a,j,d,c,czy);
            if(c==0)
            {
                if(min(g,b[g][i])>0)
                {
                    pair<int,int> f;
                    f.st=min(g,b[g][i]);
                    f.nd=max(g,b[g][i]);
                    j.push_back(f);
                }
            }
            else
            {
                if(min(g,b[g][i])>0)
                {
                   pair<int,int> f;
                    f.st=min(g,b[g][i]);
                    f.nd=max(g,b[g][i]);
                    d.push_back(f);
                }
            }
            c=(c+1)%2;
        }
    }
}
void q(vector<pair<int,int>>a,vector<ll>&wynik)
{
    
    vector<vector<int>>b(l+r+1);
    for(int i=0;i<a.size();i++)
    {
        b[a[i].nd].push_back(a[i].st);
        b[a[i].st].push_back(a[i].nd);
    }
    bool p=true;vector<vector<int>>czy(l+1,vector<int>(l+r+1));
    for(int i=0;i<b.size();i++)
    {
        if(b[i].size()>1)
        {
            p=false;
        }
        if(b[i].size()%2==1)
        {
            b[i].push_back(0);
            b[0].push_back(i);
            czy[0][i]++;
        }
    }
   // cout<<"B"<<endl;
    if(p)
    {
        for(int i=0;i<a.size();i++)
        {
            wynik[ma[a[i]]]=kol;
        }
        kol++;
       // cout<<"P"<<endl;
        return;
    }
    
    for(int i=0;i<a.size();i++)
    {
        czy[a[i].st][a[i].nd]++;
    }
    vector<pair<int,int>>j;
    vector<pair<int,int>>d;
   // cout<<"A"<<endl;
    int c=0;
    for(int i=0;i<l+r+1;i++)
    {
        dfs(i,b,a,j,d,c,czy);
    }
    q(j,wynik);
    q(d,wynik);
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>l>>r>>m;
    vector<pair<int,int>>a(m);
    //cout<<"Q"<<endl;
    for(int i=0;i<m;i++)
    {
        cin>>a[i].st>>a[i].nd;
        a[i].nd+=l;
        ma[a[i]]=i;
    }
    vector<ll>wynik(m,0);
    q(a,wynik);
    cout<<kol-1<<endl;
    for(int i=0;i<m;i++)
    {
        cout<<wynik[i]<<endl;
    }
}

Compilation message (stderr)

teoreticar.cpp: In function 'void dfs(int, std::vector<std::vector<int> >&, std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&, int&, std::vector<std::vector<int> >&)':
teoreticar.cpp:12:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for(int i=0;i<b[g].size();i++)
      |                 ~^~~~~~~~~~~~
teoreticar.cpp: In function 'void q(std::vector<std::pair<int, int> >, std::vector<long long int>&)':
teoreticar.cpp:46:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i=0;i<a.size();i++)
      |                 ~^~~~~~~~~
teoreticar.cpp:52:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for(int i=0;i<b.size();i++)
      |                 ~^~~~~~~~~
teoreticar.cpp:68:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         for(int i=0;i<a.size();i++)
      |                     ~^~~~~~~~~
teoreticar.cpp:77:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for(int i=0;i<a.size();i++)
      |                 ~^~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 13 / 13
• Subtask 3: 0 / 13
• Subtask 4: 0 / 13
• Subtask 5: 0 / 13
• Subtask 6: 0 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13
• Subtask 9: 0 / 13
• Subtask 10: 0 / 13