oj.uz

Submission #699628

# Submission time Handle Problem Language Result Execution time Memory
699628 2023-02-17T15:02:05 Z qwerasdfzxcl Languages (IOI10_languages) C++17
99 / 100
 8669 ms 38724 KB 
#include "grader.h"
#include "lang.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")

typedef long long ll;
typedef unsigned long long ull;
using namespace std;
constexpr ll DIG = 1e5, B = 57;
unordered_set<int> st[101];
unordered_set<int> st2[101];
unordered_set<ull> st3[101];
unordered_set<ull> st4[101];
unordered_set<ull> st5[101];
int fail[101][101], iter, cnt[101];

void push(int *E, int typ){

    //for (int i=0;i<100;i++) st[typ].insert(E[i]);
    for (int i=0;i<99;i++) st2[typ].insert(E[i]<<16 | E[i+1]);
    for (int i=0;i<98;i++) st3[typ].insert((ull)E[i]<<32 | (ull)E[i+1]<<16 | E[i+2]);
    for (int i=0;i<97;i++) st4[typ].insert((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3]);
    //for (int i=0;i<96;i++) st5[typ].insert((ull)E[i]<<50 ^ (ull)E[i+1]<<40 ^ (ull)E[i+2]<<30 ^ (ull)E[i+3]<<20 ^ (ull)E[i+4]<<10);
}

int calc(int *E, int typ){
    int ret = 0;
    //for (int i=0;i<100;i++){
    //    if (st[typ].find(E[i])==st[typ].end()) ret++;
    //}
    for (int i=0;i<99;i++){
        if (st2[typ].find(E[i]<<16 | E[i+1])==st2[typ].end()) ret++;
    }

    for (int i=0;i<98;i++){
        ull x = (ull)E[i]<<32 | (ull)E[i+1]<<16 | E[i+2];
        if (st3[typ].find(x)==st3[typ].end()) ret++;
    }

    for (int i=0;i<97;i++){
        ull x = (ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3];
        if (st4[typ].find(x)==st4[typ].end()) ret++;
    }

    //for (int i=0;i<96;i++){
    //    ull x = (ull)E[i]<<50 ^ (ull)E[i+1]<<40 ^ (ull)E[i+2]<<30 ^ (ull)E[i+3]<<20 ^ (ull)E[i+4]<<10;
    //    if (st5[typ].find(x)==st5[typ].end()) ret++;
    //}
    return ret;
}

int X[101];
void excerpt(int *E){
    ++iter;

    int idx = -1;
    for (int i=0;i<56;i++){
        X[i] = calc(E, i);
    }

    idx = min_element(X, X+56) - X;

    int L = language(idx);
    //if (iter>=5000 && idx!=L) printf("%d / %d\n", calc(E, idx), calc(E, L));
    push(E, L);
    cnt[L]++;
    fail[idx][L]++;

    /*if (iter==10000){
        vector<pair<int, pair<int, int>>> V;
        for (int i=0;i<56;i++){
            for (int j=0;j<56;j++) if (i!=j){
                V.emplace_back(fail[i][j], make_pair(i, j));
            }
        }

        sort(V.begin(), V.end(), greater<pair<int, pair<int, int>>>());
        for (int z=0;z<10;z++){
            printf("fail %d(%s) (ans = %d(%s)): %d\n", V[z].second.first, I[V[z].second.first].c_str(), V[z].second.second, I[V[z].second.second].c_str(), V[z].first);
        }
    }*/
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8599 ms 38724 KB Output is correct

Subtask #2
69.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 8669 ms 38684 KB Output is partially correct - 90.21%