oj.uz

Submission #1029731

# Submission time Handle Problem Language Result Execution time Memory
1029731 2024-07-21T08:39:28 Z vjudge1 Languages (IOI10_languages) C++17
100 / 100
 3438 ms 209648 KB 
#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;

map<vector<int>,unordered_set<int>> crsap;

void excerpt(int*a){
    const auto len=100;
    unordered_map<int,int> prob;
    cir(i,0,len){
        for(auto&x:crsap[{a[i]}]) prob[x]+=6;
    }
    cir(i,0,len-2){
        for(auto&x:crsap[{a[i],a[i+1],a[i+2]}]) prob[x]+=5;
    }
    // cir(i,0,len-3){
    //     for(auto&x:crsap[{a[i],a[i+1],a[i+2],a[i+3]}]) prob[x]+=4;
    // }
    cir(i,0,len-4){
        for(auto&x:crsap[{a[i],a[i+1],a[i+2],a[i+3],a[i+4]}]) prob[x]+=10;
    }
    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){
        crsap[{a[i]}].insert(ql);
    }
    cir(i,0,len-2){
        crsap[{a[i],a[i+1],a[i+2]}].insert(ql);
    }
    // cir(i,0,len-3){
    //     crsap[{a[i],a[i+1],a[i+2],a[i+3]}].insert(ql);
    // }
    cir(i,0,len-4){
        crsap[{a[i],a[i+1],a[i+2],a[i+3],a[i+4]}].insert(ql);
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3436 ms 209648 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3438 ms 209628 KB Output is correct - 91.27%