제출 #906903

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
906903		bachhoangxuan	JOIRIS (JOI16_joiris)	C++17	100 / 100	1 ms	604 KiB

joiris

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=55;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

int n,k,a[maxn],d[maxn],cnt[maxn];

void solve(){
    cin >> n >> k;
    for(int i=0;i<n;i++) cin >> a[i],d[i%k]=(d[i%k]+a[i])%k;
    for(int i=0;i<k;i++){
        int x=(i<n%k?0:k-1);
        if(d[x]!=d[i]){
            cout << -1 << '\n';
            return;
        }
    }
    vector<pii> res;
    for(int i=1;i<n;i++){
        while(a[i]<a[i-1]) a[i]+=k,res.push_back({1,i});
    }
    for(int i=1;i<n;i++){
        for(int j=0;j<a[i]-a[i-1];j++){
            for(int t=i-k;t>=0;t-=k) res.push_back({2,t});
            for(int t=0;t<i%k;t++) cnt[t]++;
        }
    }
    for(int i=0;i<k-1;i++){
        while(cnt[i]>0) res.push_back({1,i}),cnt[i]-=k;
    }
    for(int i=0;i>cnt[0];i--) for(int j=n%k;j<n;j+=k) res.push_back({2,j});
    cout << (int)res.size() << '\n';
    for(auto [x,y]:res) cout << x << ' ' << y+1 << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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