제출 #1220108

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1220108		12345678	JOIRIS (JOI16_joiris)	C++20	0 / 100	1 ms	328 KiB

joiris

#include <bits/stdc++.h>

using namespace std;

const int nx=51;

int n, k, a[nx], mx, h[nx], sm;
vector<pair<int, int>> res;

void add(int idx)
{
    int l=idx, r=idx+k-1;
    for (int i=1; i<=n; i++) if (i<l||r<i) res.push_back({1, i});
    res.push_back({2, idx});
    for (int i=l;i <=r; i++) res.push_back({1, i});
    for (int i=1; i<=n;i ++) if (i<l||r<i) h[i]=(h[i]-1+k)%k;
}

int main()
{
    //cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    for (int i=1; i<=n; i++) cin>>a[i], mx=max(mx, a[i]), sm+=a[i];
    for (int i=1; i<=n; i++) while (a[i]<mx) res.push_back({1, i}), a[i]+=k;
    for (int i=1; i<=n; i++) h[i]=a[i]%k;
    for (int i=2; i<=n-k+1; i++) 
    {
        while (h[i]!=h[i-1]) 
        {
            add(i);
            //cout<<"after add "<<i<<" : ";
            //for (int j=1; j<=n; j++) cout<<h[j]<<' ';
            //cout<<'\n';
        }
    }
    if (2*k-1==n)
    {
        while (h[1]!=h[n]) add(1);
    }
    for (int i=1; i<=n; i++) if (h[i]!=h[1]) return cout<<-1, 0;
    cout<<res.size()<<'\n';
    for (auto [x, y]:res) cout<<x<<' '<<y<<'\n';
}

/*
6 1
0 0 0 2 2 0

8 2
0 1 0 1 0 1 0 1
*/

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 55