oj.uz

답안 #699640

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
699640 2023-02-17T15:33:04 Z qwerasdfzxcl Languages (IOI10_languages) C++17
99 / 100
 7259 ms 44884 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;
bool st[101][100100];
bool st2[101][100100];
bool st22[101][100100];
bool st20[101][100100];
bool st202[101][100100];

bool st3[101][100100];
bool st32[101][100100];
bool st4[101][100100];
bool st42[101][100100];

bool st5[101][100100];
bool st52[101][100100];
bool st6[101][100100];
bool st62[101][100100];
int fail[101][101], iter, cnt[101];

unsigned short myHash(ull x){
    return (unsigned short)(x ^ x>>10 ^ x>>20 ^ x>>30 ^ x>>40 ^ x>>50 ^ x>>60);
}

unsigned short myHash2(ull x){
    return (unsigned short)(x ^ x>>11 ^ x>>22 ^ x>>33 ^ x>>44 ^ x>>55);
}

void push(int *E, int typ){

    for (int i=0;i<100;i++) st[typ][E[i]] = 1;
    for (int i=0;i<99;i++){
        st2[typ][myHash(E[i]<<16 | E[i+1])] = 1;
        st22[typ][myHash2(E[i]<<16 | E[i+1])] = 1;
    }
    for (int i=0;i<98;i++){
        st20[typ][myHash((ull)E[i]<<16 | E[i+2])] = 1;
        st202[typ][myHash2((ull)E[i]<<16 | E[i+2])] = 1;
    }
    for (int i=0;i<98;i++){
        st3[typ][myHash((ull)E[i]<<32 | (ull)E[i+1]<<16 | E[i+2])] = 1;
        st32[typ][myHash2((ull)E[i]<<32 | (ull)E[i+1]<<16 | E[i+2])] = 1;
    }
    for (int i=0;i<97;i++){
        st4[typ][myHash(((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3]))] = 1;
        st42[typ][myHash2(((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3]))] = 1;
    }

    for (int i=0;i<96;i++){
        auto x = myHash(((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3])) ^ myHash(E[i+4]);
        auto y = myHash2(((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3])) ^ myHash2(E[i+4]);
        st5[typ][x] = 1;
        st52[typ][y] = 1;
    }

    for (int i=0;i<95;i++){
        auto x = myHash(((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3])) ^ myHash(E[i+4]<<16 | E[i+5]);
        auto y = myHash2(((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3])) ^ myHash2(E[i+4]<<16 | E[i+5]);
        st6[typ][x] = 1;
        st62[typ][y] = 1;
    }
    //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][E[i]]) ret++;
    }
    for (int i=0;i<99;i++){
        auto x = (E[i]<<16 | E[i+1]);
        if (!st2[typ][myHash(x)] || !st22[typ][myHash2(x)]) ret++;
    }
    for (int i=0;i<98;i++){
        auto x = (E[i]<<16 | E[i+2]);
        if (!st20[typ][myHash(x)] || !st202[typ][myHash2(x)]) ret++;
    }

    for (int i=0;i<98;i++){
        auto x = ((ull)E[i]<<32 | (ull)E[i+1]<<16 | E[i+2]);
        if (!st3[typ][myHash(x)] || !st32[typ][myHash2(x)]) ret++;
    }

    for (int i=0;i<97;i++){
        auto x = ((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3]);
        if (!st4[typ][myHash(x)] || !st42[typ][myHash2(x)]) ret++;
    }

    for (int i=0;i<96;i++){
        auto x = myHash(((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3])) ^ myHash(E[i+4]);
        auto y = myHash2(((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3])) ^ myHash2(E[i+4]);
        if (!st5[typ][x] || !st52[typ][y]) ret++;
    }

    for (int i=0;i<95;i++){
        auto x = myHash(((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3])) ^ myHash(E[i+4]<<16 | E[i+5]);
        auto y = myHash2(((ull)E[i]<<48 | (ull)E[i+1]<<32 | (ull)E[i+2]<<16 | E[i+3])) ^ myHash2(E[i+4]<<16 | E[i+5]);
        if (!st6[typ][x] || !st62[typ][y]) 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7259 ms 44832 KB Output is correct

Subtask #2
69.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 7257 ms 44884 KB Output is partially correct - 90.31%