oj.uz

Submission #900077

# Submission time Handle Problem Language Result Execution time Memory
900077 2024-01-07T15:09:51 Z HamzaT Lampice (COCI21_lampice) C++14
50 / 50
 3 ms 4852 KB 
//struct Edge {int u, v, weight;bool operator<(Edge const& other) {return weight < other.weight;}};
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long
#define sp ' '
#define pb push_back
#define ar for(int i=1;i<=n;i++)
using namespace std;
ll t=1;
const ll N=3e5+100;
ll n,m,q,k;
ll a[N],b[N],c[N];
vector<int>v[10000];
vector<int>ans;
bool ok(int l,int r)
{
    if((r-l+1)%k!=0){return false;}
    for(int i=0;i<n;i++){v[i].clear();}
    ll lenth=(r-l+1)/k;
    for(int i=0;i<k;i++)
    {
        for(int j=1;j<=lenth;j++)
        {
            ll ndx=(i)*lenth;ndx+=l-1;
            v[i].push_back(a[ndx+j]);
        }
    }
    //  if(l==1&&r==4)for(int i=0;i<5;i++){for(auto j:v[i]){cout<<j<<" ";}cout<<endl;}
    for(int i=0;i<lenth;i++)
    {
        set<int>s;
        for(int j=0;j<k;j++)
        {
            s.insert(v[j][i]);
        }
        if(s.size()!=1){return false;}
    }
    ans=v[0];
    return true;
}
void solve()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++){cin>>a[i];}
    for(int i=1;i<=n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
                if(!ok(i,j)){continue;}
                cout<<(j-i+1)/k<<endl;
                for(auto i:ans){cout<<i<<" ";}cout<<endl;return;
        }
    }
    cout<<-1<<endl;return;
}
int main()
{
    //freopen("shell.in", "r", stdin);
   // freopen("shell.out", "w", stdout);
    ios::sync_with_stdio(NULL);
    cin.tie(NULL);cout.tie(NULL);
    // cin>>t;
    while(t--){solve();}
    return 0;
}
//09:00 :: 9:45
//10:30 ::

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 3 ms 4520 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4736 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 4852 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 3 ms 4520 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4736 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4696 KB Output is correct
16 Correct 1 ms 4852 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 1 ms 4700 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4852 KB Output is correct
28 Correct 1 ms 4732 KB Output is correct
29 Correct 1 ms 4700 KB Output is correct
30 Correct 1 ms 4700 KB Output is correct