제출 #1029697

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1029697		vjudge1	Languages (IOI10_languages)	C++17	99 / 100	9341 ms	41936 KiB

lang

#include"lang.h"
#include"grader.h"
#include<bits/stdc++.h>
#define cir(i,a,b) for(int i=a;i<b;++i)
using namespace std;

using ulint=unsigned long long;

unordered_map<int,unordered_set<ulint>> crsap;

void excerpt(int*a){
    const auto len=100;
    unordered_map<int,int> prob;
    cir(i,0,len-1){
        const auto hashx=(a[i]<<16)|(a[i+1]);
        for(auto&[ax,bx]:crsap) prob[ax]+=bx.count(hashx);
    }
    cir(i,0,len-2){
        const auto hashx=((ulint)(a[i])<<32)|(a[i+1]<<16)|a[i+2];
        for(auto&[ax,bx]:crsap) prob[ax]+=bx.count(hashx)*2;
    }
    cir(i,0,len-3){
        const auto hashx=((ulint)(a[i])<<48)|((ulint)(a[i+1])<<32)|(a[i+2]<<16)|a[i+3];
        for(auto&[ax,bx]:crsap) prob[ax]+=bx.count(hashx)*4;
    }
    pair<int,int> hx={-1,-1};
    for(auto&[ax,bx]:prob) hx=max(hx,{bx,-ax});
    const auto ql=language(-hx.second);
    cir(i,0,len-1){
        const auto hashx=(a[i]<<16)|(a[i+1]);
        crsap[ql].insert(hashx);
    }
    cir(i,0,len-2){
        const auto hashx=((ulint)(a[i])<<32)|(a[i+1]<<16)|a[i+2];
        crsap[ql].insert(hashx);
    }
    cir(i,0,len-3){
        const auto hashx=((ulint)(a[i])<<48)|((ulint)(a[i+1])<<32)|(a[i+2]<<16)|a[i+3];
        crsap[ql].insert(hashx);
    }
}

• Subtask 1: 30 / 30
• Subtask 2: 69 / 80