Submission #897635

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
897635	2024-01-03T14:12:24 Z	Macker	Languages (IOI10_languages)	C++17	62 / 100	3943 ms	6024 KB

lang

#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

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

#define SZ 100
#define MXLEN 3

set<ll> v[56][MXLEN];
ll m = 42069;
ll mod = 1e9+7;

/*
class HashedArray{
   ll B = 42069;
   ll mod = 1e9+7;
   vector<ll> hsh;
   vector<ll> pow;
public:
   HashedArray(int* s){
      hsh.resize(101, 0);
      pow.resize(101, 1);
      for (int i = 1; i < 100; i++) {
         pow[i] = pow[i - 1] * B % mod;
      }
      
      for (int i = 0; i < 100; i++) {
         hsh[i + 1] = (hsh[i] * B % mod + s[i]) % mod;
      }
   }

   ll gethsh(int s, int e){
      ll raw = hsh[e] - hsh[s] * pow[e - s];
      return (raw % mod + mod) % mod;
   }
};
*/

ll hsh(vector<int> s){
   ll res = 0;
   for (int i = 0; i < s.size(); i++) {
      res += (s[i] * m) % mod;
      res %= mod;
   }
   return res;
}

void excerpt(int *E) {
   vector<ll> score(56);
   vector<ll> cur[MXLEN];
   for (int i = 1; i < MXLEN; i++) {
      for (int j = 0; j < 100 - i; j++) {
         vector<int> tmp(E + j, E + i + j);
         cur[i].push_back(hsh(tmp));
      }
   }
   
   for (int i = 0; i < 56; i++) {
      for (int j = 1; j < MXLEN; j++) {
         for (auto &x : cur[j]) {
            if(v[i][j].find(x) != v[i][j].end()){
               score[i] += j * j;
            }
         }
      }
   }
   int mx = 0;
   int mxi = 0;
   for (int i = 0; i < 56; i++) {
      if(score[i] > mx) {
         mx = score[i];
         mxi = i;
      }
   }
   
   int lan = language(mxi);

   for (int i = 0; i < MXLEN; i++) {
      for (auto &x : cur[i]) {
         v[lan][i].insert(x);
      }
   }
   
}

Compilation message

lang.cpp: In function 'll hsh(std::vector<int>)':
lang.cpp:49:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |    for (int i = 0; i < s.size(); i++) {
      |                    ~~^~~~~~~~~~

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3879 ms	6024 KB	Output is correct

Subtask #2

32.0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	3943 ms	6004 KB	Output is partially correct - 57.98%