oj.uz

Submission #414855

# Submission time Handle Problem Language Result Execution time Memory
414855 2021-05-31T09:24:03 Z Ruxandra985 Joker (BOI20_joker) C++14
14 / 100
 2000 ms 13248 KB 
#include <bits/stdc++.h>
#define DIMN 400010
using namespace std;
int tt[DIMN];
int sz[DIMN] , opt[DIMN];
int n , m , where;
pair <int , int> mch[DIMN];
vector <pair <int , int> > s;
vector <int> v;

int root (int x){
    while (tt[x] != x)
        x = tt[x];
    return x;
}

inline void unite (int x, int y){
    int radx = root(x), rady = root(y);
    if (sz[radx] < sz[rady])
        swap (radx,rady);

    s.push_back(make_pair(radx,rady)); /// stiva pt undo
    sz[radx] += sz[rady];
    tt[rady] = radx;
}

inline void undo (){
    int x = s.back().first, y = s.back().second;
    s.pop_back();
    sz[x] -= sz[y];
    tt[y] = y;
}

void solve (int st , int dr , int l , int r){
    int mid = (st + dr)/2 , i , poz , x , y;

    //printf ("%d %d\n" , st , dr);

    //if (st == 199999 && dr == 200001){
      //  for (i = 0 ; i < v.size() ; i++){
        //    printf ("%d ", v[i]);
        //}

    //}

    for (i = min(dr , m) ; i >= mid ; i--){
        x = mch[i].first;
        y = mch[i].second;

        if (root(x) == root(y))
            break;

        unite (x , y + n);
        unite (y , x + n);
        v.push_back(i);
    }

    if (i >= mid){ /// nu se poate cu toate
        where = mid;

        i++;

        while (i <= min(dr , m)){

            undo();
            undo();
            v.pop_back();
            i++;

        }

        /// te duci doar in dreapta
        if (mid + 1 <= dr)
            solve(mid + 1 , dr , l , r);



        return;

    }

    l = max(l , 1);

    poz = 0;
    for (i = l ; i <= r && i < mid ; i++){

        x = mch[i].first;
        y = mch[i].second;

        if (root(x) == root(y) || root(y + n) == root(x + n)){
            break;
        }

        unite (x , y + n);

        unite (y , x + n);

        v.push_back(i);

        poz = i;

    }
    opt[mid] = poz;

    for (i = l ; i <= poz ; i++){
        undo();
        undo();
        v.pop_back();
    }

    if (st <= mid - 1)
        solve (st , mid - 1 , l , poz);

    for (i = mid ; i <= min(dr , m); i++){
        undo();
        undo();
        v.pop_back();
    }

    if (mid + 1 <= dr){

        for (i = l ; i < poz ; i++){
            x = mch[i].first;
            y = mch[i].second;
            unite (x , y + n);
            unite (y , x + n);
            v.push_back(i);

        }

        solve(mid + 1 , dr , poz , r);

        for (i = l ; i < poz ; i++){
            undo();
            undo();
            v.pop_back();
        }
    }

    /// convine sa te duci mai intai in dreapta, pastrezi tot ce ai adaugat
}

int main()
{
    FILE *fin = stdin;
    FILE *fout = stdout;
    int q , i , x , y , poz , j , l , r;
    fscanf (fin,"%d%d%d",&n,&m,&q);
    for (i = 1 ; i <= m ; i++){
        fscanf (fin,"%d%d",&mch[i].first,&mch[i].second);
    }

    /// opt se calculeaza intre 1 si M + 1
    mch[m + 1] = make_pair(1 , 1);

    for (i = 1 ; i <= 2 * n ; i++){
        tt[i] = i;
        sz[i] = 1;
    }

    solve (1 , m + 1 , 1 , m); /// te asiguri ca dreapta nu cauzeaza ciclu impar

    for (;q;q--){
        fscanf (fin,"%d%d",&l,&r);
        if (opt[r + 1] >= l - 1 && r + 1 > where)
            fprintf (fout,"NO\n");
        else fprintf (fout,"YES\n");
    }
    return 0;
}

Compilation message

Joker.cpp: In function 'int main()':
Joker.cpp:147:17: warning: unused variable 'x' [-Wunused-variable]
  147 |     int q , i , x , y , poz , j , l , r;
      |                 ^
Joker.cpp:147:21: warning: unused variable 'y' [-Wunused-variable]
  147 |     int q , i , x , y , poz , j , l , r;
      |                     ^
Joker.cpp:147:25: warning: unused variable 'poz' [-Wunused-variable]
  147 |     int q , i , x , y , poz , j , l , r;
      |                         ^~~
Joker.cpp:147:31: warning: unused variable 'j' [-Wunused-variable]
  147 |     int q , i , x , y , poz , j , l , r;
      |                               ^
Joker.cpp:148:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  148 |     fscanf (fin,"%d%d%d",&n,&m,&q);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:150:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  150 |         fscanf (fin,"%d%d",&mch[i].first,&mch[i].second);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:164:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  164 |         fscanf (fin,"%d%d",&l,&r);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 204 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 3 ms 456 KB Output is correct
31 Correct 3 ms 332 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 3 ms 312 KB Output is correct
34 Correct 3 ms 436 KB Output is correct
35 Correct 4 ms 440 KB Output is correct
36 Correct 3 ms 332 KB Output is correct
37 Correct 3 ms 356 KB Output is correct
38 Correct 4 ms 460 KB Output is correct
39 Correct 3 ms 460 KB Output is correct
40 Correct 4 ms 332 KB Output is correct
41 Correct 3 ms 312 KB Output is correct
42 Correct 3 ms 332 KB Output is correct
43 Correct 5 ms 332 KB Output is correct
44 Correct 5 ms 332 KB Output is correct
45 Correct 3 ms 356 KB Output is correct
46 Correct 4 ms 460 KB Output is correct
47 Correct 4 ms 332 KB Output is correct
48 Correct 4 ms 332 KB Output is correct
49 Correct 4 ms 440 KB Output is correct
50 Correct 7 ms 460 KB Output is correct
51 Correct 6 ms 332 KB Output is correct
52 Correct 5 ms 372 KB Output is correct
53 Correct 3 ms 332 KB Output is correct
54 Correct 3 ms 460 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 244 ms 6832 KB Output is correct
4 Correct 1103 ms 11356 KB Output is correct
5 Correct 508 ms 9944 KB Output is correct
6 Execution timed out 2047 ms 8356 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 244 ms 6832 KB Output is correct
30 Correct 1103 ms 11356 KB Output is correct
31 Correct 508 ms 9944 KB Output is correct
32 Execution timed out 2047 ms 8356 KB Time limit exceeded
33 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 3 ms 456 KB Output is correct
31 Correct 3 ms 332 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 3 ms 312 KB Output is correct
34 Correct 3 ms 436 KB Output is correct
35 Correct 4 ms 440 KB Output is correct
36 Correct 3 ms 332 KB Output is correct
37 Correct 3 ms 356 KB Output is correct
38 Correct 4 ms 460 KB Output is correct
39 Correct 3 ms 460 KB Output is correct
40 Correct 4 ms 332 KB Output is correct
41 Correct 3 ms 312 KB Output is correct
42 Correct 3 ms 332 KB Output is correct
43 Correct 5 ms 332 KB Output is correct
44 Correct 5 ms 332 KB Output is correct
45 Correct 3 ms 356 KB Output is correct
46 Correct 4 ms 460 KB Output is correct
47 Correct 4 ms 332 KB Output is correct
48 Correct 4 ms 332 KB Output is correct
49 Correct 4 ms 440 KB Output is correct
50 Correct 7 ms 460 KB Output is correct
51 Correct 6 ms 332 KB Output is correct
52 Correct 5 ms 372 KB Output is correct
53 Correct 3 ms 332 KB Output is correct
54 Correct 3 ms 460 KB Output is correct
55 Correct 164 ms 8608 KB Output is correct
56 Correct 588 ms 13248 KB Output is correct
57 Correct 250 ms 12332 KB Output is correct
58 Execution timed out 2065 ms 8288 KB Time limit exceeded
59 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 3 ms 456 KB Output is correct
31 Correct 3 ms 332 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 3 ms 312 KB Output is correct
34 Correct 3 ms 436 KB Output is correct
35 Correct 4 ms 440 KB Output is correct
36 Correct 3 ms 332 KB Output is correct
37 Correct 3 ms 356 KB Output is correct
38 Correct 4 ms 460 KB Output is correct
39 Correct 3 ms 460 KB Output is correct
40 Correct 4 ms 332 KB Output is correct
41 Correct 3 ms 312 KB Output is correct
42 Correct 3 ms 332 KB Output is correct
43 Correct 5 ms 332 KB Output is correct
44 Correct 5 ms 332 KB Output is correct
45 Correct 3 ms 356 KB Output is correct
46 Correct 4 ms 460 KB Output is correct
47 Correct 4 ms 332 KB Output is correct
48 Correct 4 ms 332 KB Output is correct
49 Correct 4 ms 440 KB Output is correct
50 Correct 7 ms 460 KB Output is correct
51 Correct 6 ms 332 KB Output is correct
52 Correct 5 ms 372 KB Output is correct
53 Correct 3 ms 332 KB Output is correct
54 Correct 3 ms 460 KB Output is correct
55 Correct 244 ms 6832 KB Output is correct
56 Correct 1103 ms 11356 KB Output is correct
57 Correct 508 ms 9944 KB Output is correct
58 Execution timed out 2047 ms 8356 KB Time limit exceeded
59 Halted 0 ms 0 KB -