oj.uz

Submission #235172

# Submission time Handle Problem Language Result Execution time Memory
235172 2020-05-27T08:27:58 Z kartel Usmjeri (COCI17_usmjeri) C++14
0 / 140
 479 ms 20288 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +500500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int t[4 * N], D[4 * N], i, n, l, r, x, y, m;
ll ans;

void push(int v)
{
    if (D[v])
    {
        D[v * 2] += D[v];
        D[v * 2 + 1] += D[v];
        t[v] += D[v];
        D[v] = 0;
    }
}

void upd(int v, int l, int r, int tl, int tr)
{
    push(v);
    if (l == tl && r == tr) {D[v]++;push(v); return;}
    if (l > r || tl > r || tl > tr || l > tr) return;

    int md = (l + r) >> 1;

    upd(v * 2, l, md, tl, min(tr, md));
    upd(v * 2 + 1, md + 1, r, max(md + 1, tl), tr);
}

int fnd(int v, int l, int r, int ps)
{
    push(v);
    if (l == r) return t[v];else
    {
        int md = (l + r) >> 1;
        if (ps <= md) return fnd(v * 2, l, md, ps);
                 else return fnd(v * 2 + 1, md + 1, r, ps);
    }
}

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> m;
    for (i = 1; i < n; i++)
    {
        cin >> x >> y;
        upd(1, 1, n + 1, y, y);
    }
    for (i = 1; i <= m; i++)
    {
        cin >> l >> r;
        if (l > r) swap(l, r);
        upd(1, 1, n + 1, l + 1, r);
    }

    ans = 2;

    for (i = 1; i <= n; i++)
      if (fnd(1, 1, n + 1, i) > 0 && fnd(1, 1, n + 1, i + 1) == 0) ans *= 2, ans %= M;

    cout << ans;
}

//
//110000
//110000
//001100
//001100
//000011

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 178 ms 6520 KB Output isn't correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 388 ms 17928 KB Output isn't correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 479 ms 20288 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 445 ms 19960 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 451 ms 20040 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 435 ms 20216 KB Output isn't correct
2 Halted 0 ms 0 KB -