Submission #512941

#	Time	Username	Problem	Language	Result	Execution time	Memory
512941		Markomafko972	Languages (IOI10_languages)	C++17	98 / 100	9338 ms	34632 KiB

lang

#include <bits/stdc++.h>
#include <stdlib.h>
#include <stdio.h>
#include "grader.h"
#include "lang.h"
using namespace std;
 
unordered_map<int, long long> m[60];
set<long long> s;
vector<long long> v;
 
void excerpt(int *E) {
    s.clear();
    v.clear();
    for (int i = 0; i < 100; i++) {
    	E[i]--;
        s.insert(E[i]);
        if (i > 0) s.insert((long long)65535*(long long)E[i-1]+(long long)E[i]);
 
        if (i > 1) {
            long long u = E[i-2];
            u = u * (long long)65535 + (long long)E[i-1];
            u = u * (long long)65535 + (long long)E[i];
            s.insert(u);
        }
 
        if (i > 2 && (i <= 40 || i >= 90 || i % 2 == 0 || i % 3 == 0 || i % 5 == 0 || i % 7 == 0 || i % 11 == 0)) {
            long long u = E[i-3];
            u = u * (long long)65535 + (long long)E[i-2];
            u = u * (long long)65535 + (long long)E[i-1];
            u = u * (long long)65535 + (long long)E[i];
            s.insert(u);
        }
    }
    for (set<long long> :: iterator it = s.begin(); it != s.end(); it++) v.push_back(*it);
 
    int maxim = -1, maxiv = -1, koji = 0;
    for (int i = 0; i < 56; i++) {
        int kolm = 0, kolv = 0;
        for (int j = 0; j < v.size(); j++) {
            if (m[i].find(v[j]) != m[i].end()) {
        		if (v[j] > (long long)65535*(long long)65535) kolv++;
                else kolm++;
            }
            //if (j > 1 && m[i][(long long)65535*(long long)65535*(long long)v[j-2]+(long long)65535*(long long)v[j-1]+(long long)v[j]]) kol++;
        }
 
        if (kolm+kolv > maxim+maxiv || (kolm+kolv+5 > maxim+maxiv && kolv > maxiv)) {
            if (kolm+kolv >= maxim+maxiv+2 || kolv >= maxiv) {
				maxim = kolm;
           		maxiv = kolv;
        	    koji = i;
        	}
        }
    }
 
    int pravi = language(koji);
    for (int i = 0; i < v.size(); i++) {
        m[pravi][v[i]]++;
        //if (i > 1) m[pravi][(long long)65535*(long long)65535*(long long)v[i-2]+(long long)65535*(long long)v[i-1]+(long long)v[i]]++;
    }
}

Compilation message (stderr)

lang.cpp: In function 'void excerpt(int*)':
lang.cpp:40:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |         for (int j = 0; j < v.size(); j++) {
      |                         ~~^~~~~~~~~~
lang.cpp:58:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for (int i = 0; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~

• Subtask 1: 30 / 30
• Subtask 2: 68 / 80