oj.uz

답안 #283343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283343 2020-08-25T14:48:22 Z kevlee Languages (IOI10_languages) C++17
97 / 100
 5117 ms 5796 KB 
#include "grader.h"
#include "lang.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 7897897897897897
#define base 70001
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a));
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
set <ll> s[56];
int zero;
int maxfreq, space, f[100000], cnt[56];
void excerpt(int *a) {
  FOR(i, 0, 99) {
    f[a[i]]++;
    if (f[a[i]] > maxfreq) {
      maxfreq = f[a[i]];
      space = a[i];
    }
  }
  SET(cnt, 0);
  ll hash = 0;
  int len = 0;
  vl v;
  FOR(i, 0, 99) {
    if (a[i] != space) {
      hash = (hash * base) % mod;
      hash = (hash + a[i]) % mod;
      len++;
      FOR(j, 0, 55) {
        if (s[j].count(a[i])) cnt[j]++;
      }
    } else {
      if (hash == 0 || len <= 1) continue;
      FOR(j, 0, 55) {
        if (s[j].count(hash)) cnt[j] += 4;
      }
      v.pb(hash);
      len = 0;
      hash = 0;
    }
  }
  if (hash && len > 1) {
    FOR(j, 0, 55) {
      if (s[j].count(hash)) cnt[j] += 4;
    }
    v.pb(hash);
  }
  int maxx = 0, lang = 0;
  FOR(i, 0, 55) {
    if (cnt[i] > maxx) {
      maxx = cnt[i];
      lang = i;
    }
  }
  int ans = language(lang);
  for (auto it: v) {
    s[ans].insert(it);
  }
  FOR(i, 0, 99) s[ans].insert(a[i]);
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5117 ms 5624 KB Output is correct

Subtask #2
67.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 4990 ms 5796 KB Output is partially correct - 88.48%