제출 #82597

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
82597		luciocf	Usmjeri (COCI17_usmjeri)	C++14	0 / 140	484 ms	2104 KiB

usmjeri

#include <bits/stdc++.h>

using namespace std;

const int maxn = 3e5+10;
const int mod = 1e9+7;

int open[maxn], close[maxn];

int main(void)
{
	int n, m;
	cin >> n >> m;

	for (int i = 1; i <= n-1; i++)
	{
		int a, b;
		cin >> a >> b;
	}

	for (int i = 1; i <= m; i++)
	{
		int a, b;
		cin >> a >> b;

		open[a]++, close[b]--;
	}

	int qtd = 0, x = 0;
	for (int i = 1; i < n; i++)
	{
		qtd -= close[i]; 
		if (!qtd) x++;
		qtd += open[i];
	}

	long long ans = 1;
	for (int i = 1; i <= x; i++)
		ans = (ans*2LL)%mod;

	cout << ans << "\n";
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 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