#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(vr) vr.begin(),vr.end()
#define vi vector<int>
#define vll vector<ll>
const int N = 1e5 + 10;
int in[60][N];
void excerpt(int E[])
{
set<int> st;
for (int i = 0; i < 100; ++i) st.insert(E[i]);
int id = 0, mx = -1;
for (int i = 0; i <= 55; ++i)
{
int score = 0;
for (int x : st) score += in[i][x];
if (score > mx) id = i, mx = score;
}
id = language(id);
for (int x : st) in[id][x] = 1;
}
/*int main()
{
//freopen("ss.inp", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
return 0;
}*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
264 ms |
8132 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
270 ms |
8168 KB |
Output is partially correct - 52.57% |