oj.uz

Submission #146332

# Submission time Handle Problem Language Result Execution time Memory
146332 2019-08-23T13:59:48 Z popovicirobert Languages (IOI10_languages) C++14
37 / 100
 2351 ms 116096 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) 1e9 + 7;

unordered_map <ull, bool> mp[60];
bool ok[60][66000];
bool vis[60];

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

void excerpt(int *E) {
    int i, j;

    int id = -1;
    for(int len = 4; len >= 1 && id == -1; len--) {
        ull cur = 0, pw = 1;
        for(i = 1; i < len; i++) {
            pw *= B;
        }
        for(i = 0; i + len <= 100 && id == -1; i++) {
            cur = cur * B + E[i];
            if(i >= len - 1) {
                for(int j = 0; j < 56; j++) {
                    if(mp[j][cur]) {
                        id = j;
                        break;
                    }
                }
                cur -= pw * E[i - len + 1];
            }
        }
    }


    if(id == -1) {
        unordered_map <int, int> aux;
        for(i = 0; i < 100; i++) {
            aux[E[i]] = 1;
        }
        int mx = 0;
        for(i = 0; i < 56; i++) {
            int cur = 0;
            for(auto it : aux) {
                cur += ok[i][it.first];
            }
            if(cur > mx) {
                mx = cur, id = i;
            }
        }

        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++) {
        ull cur = 0;
        for(j = i; j < i + 4 && j < 100; j++) {
            cur = cur * B + E[j];
            mp[id][cur] = 1;
        }
        ok[id][E[i]] = 1;
    }
    vis[id] = 1;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2272 ms 116064 KB Output is correct

Subtask #2
7.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 2351 ms 116096 KB Output is partially correct - 35.93%