Submission #1369229


Source Code Expand

#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>

using namespace std;

#ifndef _DEBUG
#define main_ main
#endif
#define FOR(i,s,e) for (int i = int(s); i < int(e); ++i)
#define REP(i,e) FOR(i,0,e)
#define INF (INT_MAX/2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX/2)

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<string> vs;

template <typename T>
using keyVal = pair<string, T>;
template<typename T>
bool val_greater(const keyVal<T>& left, const keyVal<T>& right) {
	return left.second > right.second;
}

vs split(string str, char sep) {
	vs v; stringstream ss(str); string t;
	while (getline(ss, t, sep)) v.push_back(t);
	return v;
}

void init_global() {}

int main_() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, M; cin >> N >> M;
	vi R(N+4, 0);
	vi S(M+1,0), T(M+1,0);
	FOR(i, 1, M+1) cin >> S[i]>>T[i];
	
	FOR(i, 1, M+1) {
		R[S[i]] += 1;
		R[T[i] + 1] -= 1;
	}

	FOR(i, 1, N+1) {
		R[i] += R[i - 1];
	}

	vi span;
	FOR(i, 1, M+1) {
		bool ok = true;
		FOR(j, S[i], T[i] + 1) {
			if (R[j] <= 1) {
				ok = false;
				break;
			}
		}
		if (ok) span.push_back(i);
	}
	
	cout << span.size() << endl;
	FOR(i, 0, span.size()) {
		cout << span[i] << endl;
	}

	return 0;
}

Submission Info

Submission Time
Task B - ドキドキデート大作戦高橋君
User apprec
Language C++14 (GCC 5.4.1)
Score 30
Code Size 1499 Byte
Status TLE
Exec Time 2103 ms
Memory 3320 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
AC × 12
AC × 17
TLE × 3
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 1 ms 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask0_sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 19 ms 2176 KB
subtask1_02.txt AC 172 ms 3320 KB
subtask1_03.txt AC 18 ms 1792 KB
subtask1_04.txt AC 98 ms 2300 KB
subtask1_05.txt AC 100 ms 2300 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask2_01.txt TLE 2103 ms 2304 KB
subtask2_02.txt TLE 2103 ms 2304 KB
subtask2_03.txt AC 1 ms 256 KB
subtask2_04.txt AC 1 ms 256 KB
subtask2_05.txt AC 1 ms 256 KB
subtask2_06.txt AC 1 ms 256 KB
subtask2_07.txt AC 1 ms 256 KB
subtask2_08.txt TLE 2103 ms 2176 KB