oj.uz

Submission #363369

# Submission time Handle Problem Language Result Execution time Memory
363369 2021-02-05T18:13:00 Z cig32 Languages (IOI10_languages) C++17
0 / 100
 1 ms 364 KB 
#include "bits/stdc++.h"
#include "lang.h"
#include "grader.h"
using namespace std;
int word[65536][56];
void excerpt(int *a){
    int s[56];
    int m=0;
    for(int j=0;j<56;j++)s[j]=0;
    for(int j=0;j<100;j++){
        for(int k=0;k<56;k++){
            s[k]+=word[a[j]][k];
            m=max(m,s[k]);
        }
    }
    for(int j=0;j<56;j++){
        if(s[j]==m){
            cout<<j<<"\n";
            break;
        }
    }
    int ans;
    cin >> ans;
    for(int j=0;j<100;j++){
        word[a[j]][ans]++;
    }
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Hacked.

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Hacked.