제출 #1029682

#제출 시각아이디문제언어결과실행 시간메모리
1029682vjudge1Languages (IOI10_languages)C++17
81 / 100
1528 ms10008 KiB
#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);
    }
    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);
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...