oj.uz

답안 #146364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146364 2019-08-23T15:32:25 Z popovicirobert Languages (IOI10_languages) C++14
0 / 100
 5016 ms 262148 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long

using namespace std;

#include "grader.h"
#include "lang.h"

#define SZ 100

const int B = (int) 1e5;

unordered_map <ll, int> ok[60];
bool vis[60];

inline ll myrand() {
    return (1LL * rand() << 15) + rand();
}

void excerpt(int *E) {
    int i, j;
    unordered_map <ll, int> mp;
    for(i = 0; i < 100; i++) {
        ll cur = 0;
        for(j = i; j < 100 && j < i + 3; j++) {
            cur = cur * B + E[j];
            mp[cur]++;
        }
    }

    vector <int> arr(56);
    int id = -1;
    for(auto it : mp) {
        for(i = 0; i < 56; i++) {
            if(ok[i][it.first]) {
                arr[i]++;
            }
        }
    }
    id = max_element(arr.begin(), arr.end()) - arr.begin();
    if(arr[id] == 0) {
        id = -1;
    }

    if(id == -1) {
        vector <int> ids;
        for(i = 0; i < 56; i++) {
            if(vis[i] == 0) ids.push_back(i);
        }
        int sz = ids.size();
        id = ids[myrand() % sz];
    }

    id = language(id);
    for(i = 0; i < 100; i++) {
        ll cur = 0;
        if(i % 10 == 0) {
            for(j = i; j < 100 && j < i + 3; j++) {
                cur = cur * B + E[j];
                if(i < j)
                    ok[id][cur]++;
            }
        }
        ok[id][E[i]]++;
    }
    vis[id] = 1;
}

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5016 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4401 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)