oj.uz

답안 #146387

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146387 2019-08-23T16:17:12 Z popovicirobert Languages (IOI10_languages) C++14
0 / 100
 2746 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 <ull, bool> ok[60];
bool vis[60];

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

void excerpt(int *E) {
    int i, j;
    unordered_map <ull, bool> mp;
    for(i = 0; i + 4 <= 100; i++) {
        ull cur = 0;
        for(j = i; j < i + 4; j++) {
            cur = (cur << 16) + E[j];
        }
        mp[cur] = 1;
    }

    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();

    id = language(id);
    for(i = 0; i + 4 <= 100; i++) {
        ull cur = 0;
        for(j = i; j < i + 4; j++) {
            cur = (cur << 16) + E[j];
        }
        ok[id][cur] = 1;
    }
    vis[id] = 1;
}

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2746 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 2704 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)