답안 #630697

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
630697	2022-08-16T23:34:03 Z	Joshua_Andersson	최후의 만찬 (IOI12_supper)	C++14	100 / 100	115 ms	17208 KB

#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/stdc++.h>
using namespace std;

#define enablell 0

typedef long long ll;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;

#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin__popcount(x)
#define leading_zeros(x) __builtin_clz(x)
#define gc() getchar_unlocked()
#if 0
#include <bits/extc++.h>
using namespace __gnu_pbds;
struct chash { // large odd number for C
    const uint64_t C = ll(4e18 * acos(0)) | 71;
    ll operator()(ll x) const { return x; }
};
//typedef __gnu_pbds::gp_hash_table<int, null_type, chash> h;
#endif

#endif

#define FILE_TC 0
#if FILE_TC
ifstream filein("C:\\Users\\Matis\\source\\repos\\Comp prog\\x64\\Debug\\in.txt");
#define cin filein
//ifstream cin("C:\\Users\\Matis\\desktop\\po-two\\swedish-olympiad-2014\\");
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif

#if !FILE_TC
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
template <typename T> inline void write(T& a) { cout << (a) << "\n"; }
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if (!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debassert(expr) ;
#define debif(expr) ;
#endif

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)

#define all(a) a.begin(),a.end()
#define revall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))
#define first(a) (*begin(a))
#define indexpair(p, i) ((i==0)?p.first:p.second)
#define chmax(a,b) ((a)=max((a),b))
#define chmin(a,b) ((a)=min((a),b))

#define ceildiv(x,y) ((x + y - 1) / y)
#define fract(a) (a-floor(a))

template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }

#if 0
auto Start = chrono::high_resolution_clock::now();
#define elapsedmillis() (chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count())
#define rununtil(time) if (elapsedmillis() >= time) break;
random_device rd;
mt19937 rng(rd());
#endif
const int mod = 1e9 + 7;

#include "advisor.h"

//void WriteAdvice(unsigned char a) {};
void WriteAdvice(unsigned char a);

bitset<int(2e5)> message;
void ComputeAdvice(int* c, int n, int k, int m)
{
    vvi occurences(n);
    rep(i, n)
    {
        occurences[c[i]].push_back(i);
    }

    priority_queue<p2> pq;
    vb inq(n);

    rep(i, k)
    {
        int priority = occurences[i].size() ? occurences[i][0] : inf;
        pq.emplace(priority, i);
        inq[i] = true;
    }


    vvi chopsmade(n);
    vi choporder(n, -1);
    rep(i, n)
    {
        int col = c[i];

        if (inq[c[i]])
        {
            auto it = upper_bound(all(occurences[c[i]]), i);
            pq.emplace(it == occurences[c[i]].end() ? inf : *it, c[i]);
            continue;
        }
        p2 chop = pq.top();
        pq.pop();
        inq[chop.second] = false;
        chopsmade[chop.second].push_back(i);
        choporder[i] = chop.second;
        auto it = upper_bound(all(occurences[c[i]]), i);
        pq.emplace(it == occurences[c[i]].end() ? inf : *it, c[i]);
        inq[c[i]] = true;
    }

    // 0 chopping block
    // 1 wait for update
    rep(i, k)
    {
        if (occurences[i].empty()) message[i] = 0;
        else if (chopsmade[i].empty()) message[i] = 1;
        else if (occurences[i][0] < chopsmade[i][0]) message[i] = 1;
        else if (occurences[i][0] > chopsmade[i][0]) message[i] = 0;
        else assert(false);
    }

    stack<int> chopblock;
    rep(i, k) if (message[i] == 0)chopblock.push(i);
    vi status(k);
    rep(i, k) status[i] = message[i];
    set<int> shelf;
    rep(i, k) shelf.insert(i);

    vi inchop(n);

    rep(i, n)
    {

        //if (!setcontains(shelf, c[i]))
        //{
        //    
        //    int topop = chopblock.top();
        //    inchop[topop] = false;
        //    chopblock.pop();
        //    shelf.erase(topop);
        //    //status[topop] = 1;
        //    shelf.insert(c[i]);
        //}

        auto nextQit = upper_bound(all(occurences[c[i]]), i);
        auto nextChopit = upper_bound(all(chopsmade[c[i]]), i);
        // These should hopefully never be equal
        int nextQ = nextQit == occurences[c[i]].end() ? inf : *nextQit;
        int nextChop = nextChopit == chopsmade[c[i]].end() ? inf : *nextChopit;

        if (nextChop < nextQ)
        {
            // Add to chopping block
            message[i + k] = 0;

        }
        else
        {
            message[i + k] = 1;
        }
    }

    rep(i, n + k) WriteAdvice(message[i]);


}
//int32_t main()
//{
//    fast();
//
//    rep(i, 1000)
//    {
//        int n = rand() % 10;
//        if (n == 0) continue;
//        int k = rand() % n;
//        vi bois(n);
//        rep(i, n) bois[i] = rand() % n;
//        if (k < 2 || n < 1) continue;
//        ComputeAdvice(&bois[0], n, k, 0);
//    }
//
//    quit;
//}

#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/stdc++.h>
using namespace std;

#define enablell 0

typedef long long ll;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;

#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin__popcount(x)
#define leading_zeros(x) __builtin_clz(x)
#define gc() getchar_unlocked()
#if 0
#include <bits/extc++.h>
using namespace __gnu_pbds;
struct chash { // large odd number for C
    const uint64_t C = ll(4e18 * acos(0)) | 71;
    ll operator()(ll x) const { return x; }
};
//typedef __gnu_pbds::gp_hash_table<int, null_type, chash> h;
#endif

#endif

#define FILE_TC 0
#if FILE_TC
ifstream filein("C:\\Users\\Matis\\source\\repos\\Comp prog\\x64\\Debug\\in.txt");
#define cin filein
//ifstream cin("C:\\Users\\Matis\\desktop\\po-two\\swedish-olympiad-2014\\");
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif

#if !FILE_TC
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
template <typename T> inline void write(T& a) { cout << (a) << "\n"; }
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if (!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debassert(expr) ;
#define debif(expr) ;
#endif

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)

#define all(a) a.begin(),a.end()
#define revall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))
#define first(a) (*begin(a))
#define indexpair(p, i) ((i==0)?p.first:p.second)
#define chmax(a,b) ((a)=max((a),b))
#define chmin(a,b) ((a)=min((a),b))

#define ceildiv(x,y) ((x + y - 1) / y)
#define fract(a) (a-floor(a))

template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }

#if 0
auto Start = chrono::high_resolution_clock::now();
#define elapsedmillis() (chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count())
#define rununtil(time) if (elapsedmillis() >= time) break;
random_device rd;
mt19937 rng(rd());
#endif
const int mod = 1e9 + 7;


#include "assistant.h"
void PutBack(int T);
int GetRequest();

void Assist(unsigned char* a, int n, int k, int r)
{
    vb message(n + k);
    rep(i, n + k)
    {
        message[i] = a[i];
    }
    queue<int> chopblock;
    rep(i, k) if (message[i] == 0)chopblock.push(i);

    vi shelf(n);
    rep(i, k) shelf[i] = true;

    vi inchop(n);

    rep(i, n)
    {
        int req = GetRequest();
        if (!shelf[req])
        {
            int topop = chopblock.front();
            inchop[topop] = false;
            chopblock.pop();
            shelf[topop] = false;
            PutBack(topop);
            shelf[req] = true;
        }

        if (message[i + k] == 0)
        {
            if (!inchop[req])
            {
                chopblock.push(req);
                inchop[req] = true;
            }
        }
    }
}

Compilation message

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:168:13: warning: unused variable 'col' [-Wunused-variable]
  168 |         int col = c[i];
      |             ^~~

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	516 KB	Output is correct
2	Correct	0 ms	512 KB	Output is correct
3	Correct	1 ms	644 KB	Output is correct
4	Correct	3 ms	800 KB	Output is correct
5	Correct	4 ms	1340 KB	Output is correct
6	Correct	4 ms	1300 KB	Output is correct
7	Correct	4 ms	1204 KB	Output is correct
8	Correct	5 ms	1464 KB	Output is correct
9	Correct	7 ms	1364 KB	Output is correct
10	Correct	6 ms	1456 KB	Output is correct
11	Correct	5 ms	1316 KB	Output is correct

Subtask #2
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	1944 KB	Output is correct
2	Correct	41 ms	6768 KB	Output is correct
3	Correct	97 ms	16860 KB	Output is correct
4	Correct	107 ms	13768 KB	Output is correct
5	Correct	103 ms	13848 KB	Output is correct
6	Correct	109 ms	14356 KB	Output is correct
7	Correct	111 ms	15100 KB	Output is correct
8	Correct	96 ms	14756 KB	Output is correct
9	Correct	77 ms	11104 KB	Output is correct
10	Correct	98 ms	15692 KB	Output is correct

Subtask #3
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	87 ms	11492 KB	Output is correct
2	Correct	104 ms	15300 KB	Output is correct
3	Correct	99 ms	15332 KB	Output is correct
4	Correct	101 ms	15084 KB	Output is correct
5	Correct	115 ms	13892 KB	Output is correct
6	Correct	97 ms	15444 KB	Output is correct
7	Correct	93 ms	15280 KB	Output is correct
8	Correct	105 ms	17208 KB	Output is correct
9	Correct	84 ms	13728 KB	Output is correct
10	Correct	95 ms	15484 KB	Output is correct

Subtask #4
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	1192 KB	Output is correct
2	Correct	5 ms	1464 KB	Output is correct
3	Correct	5 ms	1176 KB	Output is correct
4	Correct	5 ms	1312 KB	Output is correct
5	Correct	4 ms	1340 KB	Output is correct
6	Correct	4 ms	1336 KB	Output is correct
7	Correct	5 ms	1312 KB	Output is correct
8	Correct	7 ms	1332 KB	Output is correct
9	Correct	5 ms	1344 KB	Output is correct
10	Correct	6 ms	1528 KB	Output is correct

Subtask #5
39.0 / 39.0

#	결과	실행 시간	메모리	Grader output
1	Correct	98 ms	14108 KB	Output is correct - 120000 bits used
2	Correct	107 ms	14088 KB	Output is correct - 122000 bits used
3	Correct	105 ms	14312 KB	Output is correct - 125000 bits used
4	Correct	95 ms	14320 KB	Output is correct - 125000 bits used
5	Correct	108 ms	14180 KB	Output is correct - 125000 bits used
6	Correct	99 ms	14232 KB	Output is correct - 125000 bits used
7	Correct	101 ms	14292 KB	Output is correct - 124828 bits used
8	Correct	100 ms	14196 KB	Output is correct - 124910 bits used
9	Correct	106 ms	14324 KB	Output is correct - 125000 bits used
10	Correct	110 ms	15860 KB	Output is correct - 125000 bits used

답안 #630697

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 9.0 / 9.0

Subtask #3 9.0 / 9.0

Subtask #4 35.0 / 35.0

Subtask #5 39.0 / 39.0

Subtask #1
8.0 / 8.0

Subtask #2
9.0 / 9.0

Subtask #3
9.0 / 9.0

Subtask #4
35.0 / 35.0

Subtask #5
39.0 / 39.0