제출 #50044

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
50044		Benq	Languages (IOI10_languages)	C++14	0 / 100	10098 ms	1244 KiB

lang

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

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

#define SZ 100

// int language(int x) { cout << x << "\n"; return 0; }

map<int,int> m[56], tmp;
int tot[56];

double tri(int lang) {
    if (sz(m[lang]) == 0) return MOD;
    map<int,double> M;
    for (auto a: m[lang]) M[a.f] -= (double)a.s/tot[lang];
    for (auto a: tmp) M[a.f] += a.s;
    
    double dif = 0;
    for (auto a: M) dif += abs(a.s);
    // cout << "HI " << dif << "\n";
    return dif;
}

void excerpt(int *E) {
    pair<double,int> bes = {MOD,0};
    tmp.clear();
    F0R(i,100) tmp[E[i]] ++;
    F0R(i,56) bes = min(bes,{tri(i),i});
    
    int x = language(bes.s);
    tot[x] ++;
    F0R(i,100) m[x][E[i]] ++;
}

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