# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288090 | mhy908 | JOIRIS (JOI16_joiris) | C++14 | 1 ms | 416 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
const LL llinf=2e18;
const int inf=1e9;
vector<pii> ans;
int n, k;
int arr[60];
void put_vert(int x){ans.eb(1, x);}
void put_hori(int x){ans.eb(2, x);}
void erase_lin(){
int ernum=*min_element(arr+1, arr+n+1);
for(int i=1; i<=n; i++)arr[i]-=ernum;
}
int cnt[60];
int main(){
scanf("%d %d", &n, &k);
for(int i=1; i<=n; i++){
scanf("%d", &arr[i]);
cnt[(i-1)%k]+=arr[i];
cnt[(i-1)%k]%=k;
}
for(int i=0; i<=(n%k)-1; i++){
if(cnt[i]!=cnt[0])return !printf("-1");
}
for(int i=n%k; i<k; i++){
if(cnt[i]!=cnt[k-1])return !printf("-1");
}
for(int i=2; i<=n; i++){
while(arr[i]<arr[i-1]){
arr[i]+=k;
put_vert(i);
}
}
for(int i=1; i<=arr[n]; i++){
int l;
for(int j=1; j<=n; j++){
if(arr[j]>=i){
l=j-1;
break;
}
}
while(1){
if(l-k+1<=0)break;
put_hori(l-k+1);
for(int j=l-k+1; j<=l; j++)arr[j]++;
l-=k;
}
}
for(int i=1; i<=k; i++){
for(int j=1; j<i; j++){
while(arr[j]<arr[n]){
arr[j]+=k;
put_vert(j);
}
}
erase_lin();
}
int mx=0;
for(int i=n%k+1; i<k; i++){
mx=max(mx, arr[i]);
}
for(int i=n%k+1; i<=n; i++){
while(1){
if(arr[i]==mx)break;
arr[i]+=k;
put_vert(i);
}
}
erase_lin();
mx=0;
for(int i=1; i<=n%k; i++){
mx=max(mx, arr[i]);
}
for(int i=1; i<=n%k; i++){
while(1){
if(arr[i]==mx)break;
arr[i]+=k;
put_vert(i);
}
}
for(int i=1; i<=arr[1]; i++){
for(int j=n%k+1; j<=n; j+=k){
put_hori(j);
}
}
printf("%d\n", ans.size());
for(auto i:ans)printf("%d %d\n", i.F, i.S);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |