Submission #235179

#	Time	Username	Problem	Language	Result	Execution time	Memory
235179		kartel	Usmjeri (COCI17_usmjeri)	C++14	28 / 140	218 ms	8844 KiB

usmjeri

#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;

vector <pair <int, int> > ve;
int i, r, j, l, n, m, x, y;
ll ans;

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;
        ve.pb({x + 1, y});
    }
    for (i = 1; i <= m; i++)
    {
        cin >> l >> r;
        if (l > r) swap(l, r);
        ve.pb({l + 1, r});
    }

    ans = 1;

    sort(ve.begin(), ve.end());

    i = 0;
    while (i < n + m - 1)
    {
        r = ve[i].S;
        ans *= 2;
        ans %= M;
        j = i + 1;
        while (j < n + m - 1 && r >= ve[j].F)
        {
            r = max(r, ve[j].S);
            j++;
        }
        i = j;
    }
    cout << ans;
}

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

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