# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288087 | 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[110], cnt[110], r[110];
void put_vert(int x){ans.eb(1, x);}
void put_hori(int x){ans.eb(2, x);}
int main(){
scanf("%d %d", &n, &k);
for(int i=0; i<n; i++){
scanf("%d", &arr[i]);
cnt[i%k]+=arr[i];
cnt[i%k]%=k;
}
for(int i=0; i<n%k; 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=1; i<n; i++){
while(arr[i]<arr[i-1]){
arr[i]+=k;
put_vert(i);
}
}
for(int i=0; i<n-1; i++){
for(int j=arr[i]; j<arr[i+1]; j++){
for(int l=i-k+1; l>=0; l-=k)put_hori(l);
if(i%k!=k-1)r[i%k]--;
}
}
for(int i=k-3; i>=0; i--)r[i]+=r[i+1];
for(int i=0; i<n; i++){
while(r[i]<0){
put_vert(i);
r[i]+=k;
}
}
if(n%k>=1&&r[0]<r[k-1]){
for(int i=0; i<n%k; i++){
put_vert(i);
r[i]+=k;
}
}
if(n%k>=1){
for(int i=n-k; i>=0; i-=k){
for(int j=0; j<r[0]-r[k-1]; j++)put_hori(i);
}
}
printf("%d\n", ans.size());
for(auto i:ans)printf("%d %d\n", i.F, i.S+1);
}
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... |