Submission #1173386


Source Code Expand

#include <algorithm>
#include <climits> //INT_MIN/MAX
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define FOR(i, s, e) for (ll(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (ll(i) = (s); (i) > (e); (i)--)
#define debug(x) cout << #x << ": " << x << endl
#define mp make_pair
#define pb push_back
const ll MOD = 1000000007;
const int INF = 1e9;
const ll LINF = 1e16;
const double PI = acos(-1.0);
int dx[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };
int dy[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  xtimex  Problem:  / Link:
 * http://arc045.contest.atcoder.jp/tasks/arc045_b ----- */
/* ------問題------



-----問題ここまで----- */
/* -----解説等-----



----解説ここまで---- */

ll N, M;
int s[100000],t[100000];
int m[100010],a[100010];
int sum[100010];

int main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    cin >> N >> M;
    FOR(i, 0, M)
    {
        cin >> s[i] >> t[i];
        m[s[i]]++; m[t[i]+1]--;
    }
    a[0]=0;
    FOR(i, 0, N + 3){
        a[i+1] = a[i] + m[i+1];
    }
    FOR(i,0,N+3){
        if(a[i]>=2)a[i]=1;
        else a[i]=0;
    }
    FOR(i,0,N+3){
        sum[i+1]=sum[i]+a[i+1];
    }

    vector<int>ans;
    FOR(i,0,M){
        if(sum[t[i]]-sum[s[i]-1]==t[i]-s[i]+1)
        ans.push_back(i+1);
    }

    cout << ans.size() << endl;

    FOR(i,0,ans.size()){
        cout << ans[i] << endl;
    }


    return 0;
}

Submission Info

Submission Time
Task B - ドキドキデート大作戦高橋君
User Yang33
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1718 Byte
Status RE
Exec Time 321 ms
Memory 2812 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 3
AC × 7
WA × 3
RE × 2
AC × 12
WA × 4
RE × 4
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 RE 321 ms 2176 KB
subtask1_02.txt RE 112 ms 2560 KB
subtask1_03.txt WA 78 ms 2684 KB
subtask1_04.txt WA 95 ms 2812 KB
subtask1_05.txt WA 96 ms 2812 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 RE 110 ms 2812 KB
subtask2_02.txt RE 112 ms 2560 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 WA 71 ms 2684 KB