Submission #1634844


Source Code Expand

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
#define EPS 1e-12
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }

mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;




ll m, n, kei;

int main() {

    scanner >> n >> m;

    vector<int> room(n+1);
    vector<pair<int,int>> rang;

    rang.reserve(m+5);

    repeat(i, m) {
        int s, t;
        scanner >> s >> t;
        --s;
        rang.emplace_back(s, t);
        room[s]++;
        room[t]--;
    //debugv(room);
    }

    {
        int z = 0;
        for (int& e : room)
            z = e += z;
    }
    // この時点で,roomには区間が重なっている個数が入っている.
    //debugv(room);
    
    for (int& e : room)
        e = e <= 1;

    //debugv(room);
    {
        int z = 0;
        repeat(i, n){
            int t = room[i];
            room[i] = z;
            z += t;
        }
    }
    //debugv(room);
    

    vector<int> safe;
    safe.reserve(m);

    repeat(i, m) {
        auto r = rang[i];
        //cout << room[r.second] <<' '<< room[r.first] << endl;
        if (room[r.second] - room[r.first] == 0) {
            safe.push_back(i);
        }
    }

    printf("%d\n", (int)safe.size());
    for (auto e : safe)
        printf("%d\n", e+1);


    return 0;
}

Submission Info

Submission Time
Task B - ドキドキデート大作戦高橋君
User m_buyoh
Language C++14 (GCC 5.4.1)
Score 0
Code Size 4190 Byte
Status WA
Exec Time 14 ms
Memory 3200 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 2
WA × 1
AC × 8
WA × 4
AC × 9
WA × 11
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 WA 1 ms 256 KB
subtask0_sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 6 ms 2176 KB
subtask1_02.txt WA 14 ms 3200 KB
subtask1_03.txt AC 5 ms 1792 KB
subtask1_04.txt AC 10 ms 2176 KB
subtask1_05.txt AC 10 ms 2048 KB
subtask1_06.txt WA 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt WA 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask2_01.txt WA 5 ms 2176 KB
subtask2_02.txt AC 14 ms 3200 KB
subtask2_03.txt WA 1 ms 256 KB
subtask2_04.txt WA 1 ms 256 KB
subtask2_05.txt WA 1 ms 256 KB
subtask2_06.txt WA 1 ms 256 KB
subtask2_07.txt WA 1 ms 256 KB
subtask2_08.txt WA 14 ms 2816 KB