oj.uz

Submission #151554

# Submission time Handle Problem Language Result Execution time Memory
151554 2019-09-03T14:21:10 Z Ruxandra985 Teoretičar (COCI18_teoreticar) C++14
91 / 130
 12000 ms 97276 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <bitset>
using namespace std;
vector <pair <int,int> > v[400010];
vector <pair <pair <int,int>,int> > mc;
int sol[500010];
int g[400010];
int f[500010];
int m , st , dr;
void dfs (int nod,int pus,vector <pair <pair <int,int>,int> > other[2]){
    int i,vecin,mch;
    for (i=0;i<v[nod].size();i++){
        vecin = v[nod][i].first;
        mch = v[nod][i].second;
        //printf ("%d\n",mch)
        if (!f[mch]){
            f[mch] = 1;
            g[nod]--;
            g[vecin]--;
            other[pus].push_back(make_pair(make_pair(nod,vecin),mch));
            dfs (vecin,1-pus,other);
            return;
        }
    }
}
void pune (vector <pair <pair <int,int>,int> > mc , int &cul){
    /// pt chestia cu 2^x , o sa imparti muchiile mereu in 2
    int i,x,y,idx,gmax;
    /// verifici daca setul tau e independent
    gmax = 0;
    for (i=0;i<mc.size();i++){
        x = mc[i].first.first;
        y = mc[i].first.second;
        //printf ("%d %d\n",x,y);
        idx = mc[i].second;
        f[idx] = 0;

        v[x].push_back(make_pair(y,idx));
        v[y].push_back(make_pair(x,idx));
        g[y]++; g[x]++;
        gmax = max (gmax , g[x]);
        gmax = max (gmax , g[y]);
    }
    //printf ("\n\n");
    if ( gmax < 2 ) { /// e independent , pui cul peste tot
        if (!mc.empty())
            cul++;
        for (i=0;i<mc.size();i++){
            idx = mc[i].second;
            g[mc[i].first.first] = g[mc[i].first.second] = 0;
            v[mc[i].first.first].clear();
            v[mc[i].first.second].clear();
            sol[idx] = cul;
        }
        return;
    }
    vector <pair <pair <int,int>,int> > other[2];
    /// vrei sa imparti muchiile in doua seturi astfel incat niciuna din primul set
    /// sa nu aiba aceeasi culoare cu una din al doilea set
    /// iei pur si simplu drumuri maximale si pui muchiile alternant,cum faceam
    /// si la euler
    /// trebuie sa am grija ca mereu sa pun ceva in ambele other uri

    for (i=1;i<=st+dr;i++){
        if (g[i]%2)
            dfs(i,0,other);
    }

    for (i=1;i<=st+dr;i++){
        while (g[i]){
            dfs (i,0,other);
        }
        v[i].clear();
    }
    pune(other[0],cul);
    pune(other[1],cul);

}
char buff[7000000];
int poz = 0;
int getnr(){
    int nr = 0;
    while ('0' > buff[poz] || buff[poz] > '9')
        poz++;
    while ('0'<=buff[poz] && buff[poz]<='9'){
        nr = nr * 10 + buff[poz] - '0';
        poz++;
    }
    return nr;
}
int main()
{
    FILE *fin = stdin;
    FILE *fout = stdout;
    int i,x,y,cul=0;
    fread (buff,1,7000000,fin);
    st = getnr();
    dr = getnr();
    m = getnr();
    int mi = m;
    for (i=1;i<=m;i++){
        x = getnr();
        y = getnr();
        y+=st;
        mc.push_back(make_pair(make_pair(x,y),i));

    }
    cul = 0;
    pune(mc,cul);

    fprintf (fout,"%d\n",cul);
    for (i=1;i<=mi;i++)
        fprintf (fout,"%d\n",sol[i]);
    return 0;
}

Compilation message

teoreticar.cpp: In function 'void dfs(int, int, std::vector<std::pair<std::pair<int, int>, int> >*)':
teoreticar.cpp:15:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i=0;i<v[nod].size();i++){
              ~^~~~~~~~~~~~~~
teoreticar.cpp: In function 'void pune(std::vector<std::pair<std::pair<int, int>, int> >, int&)':
teoreticar.cpp:34:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i=0;i<mc.size();i++){
              ~^~~~~~~~~~
teoreticar.cpp:51:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i=0;i<mc.size();i++){
                  ~^~~~~~~~~~
teoreticar.cpp: In function 'int main()':
teoreticar.cpp:99:11: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     fread (buff,1,7000000,fin);
     ~~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9724 KB Output is correct
5 Correct 10 ms 9720 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9848 KB Output is correct
3 Correct 10 ms 9768 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 10 ms 9720 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 10360 KB Output is correct
2 Correct 14 ms 10360 KB Output is correct
3 Correct 15 ms 10360 KB Output is correct
4 Correct 13 ms 10360 KB Output is correct
5 Correct 12 ms 10236 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 10360 KB Output is correct
2 Correct 16 ms 10360 KB Output is correct
3 Correct 17 ms 10644 KB Output is correct
4 Correct 13 ms 10488 KB Output is correct
5 Correct 12 ms 10232 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 659 ms 48072 KB Output is correct
2 Correct 4823 ms 81068 KB Output is correct
3 Correct 1313 ms 64216 KB Output is correct
4 Correct 773 ms 76224 KB Output is correct
5 Correct 670 ms 64144 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 693 ms 47976 KB Output is correct
2 Correct 1239 ms 64696 KB Output is correct
3 Correct 1896 ms 72908 KB Output is correct
4 Correct 691 ms 67028 KB Output is correct
5 Correct 137 ms 26340 KB Output is correct

Subtask #7
0 / 13.0

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

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1763 ms 97276 KB Output is correct
2 Correct 5721 ms 83800 KB Output is correct
3 Correct 2574 ms 76216 KB Output is correct
4 Correct 1101 ms 86440 KB Output is correct
5 Correct 714 ms 67132 KB Output is correct

Subtask #9
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3142 ms 76752 KB Output is correct
2 Execution timed out 12062 ms 88548 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3113 ms 76828 KB Output is correct
2 Execution timed out 12024 ms 87772 KB Time limit exceeded
3 Halted 0 ms 0 KB -