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>
using namespace std;
#define IOS ios::sync_with_stdio(false);; cin.tie(NULL)
void selfMax(long long& a, long long b){
a = max(a, b);
}
void selfMin(long long& a, long long b){
a = min(a, b);
}
template<typename T> istream& operator>>(istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& x) {return in >> x.first >> x.second;}
template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1, T2>& x) {return out << x.first << ' ' << x.second;}
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};
template<typename T> ostream& operator<<(ostream& out, vector<vector<T> >& a) {for(auto &x : a) out << x << '\n'; return out;};
template<typename T1, typename T2> ostream& operator<<(ostream& out, vector<pair<T1, T2> >& a) {for(auto &x : a) out << x << '\n'; return out;};
/*
Use DSU dsu(N);
*/
struct DSU {
vector<long long> adj2;
DSU(long long N) { adj2 = vector<long long>(N, -1); }
// get representive component (uses path compression)
long long get(long long x) { return adj2[x] < 0 ? x : adj2[x] = get(adj2[x]); }
bool same_set(long long a, long long b) { return get(a) == get(b); }
long long size(long long x) { return -adj2[get(x)]; }
bool unite(long long x, long long y) { // union by size
x = get(x), y = get(y);
if (x == y) return false;
if (adj2[x] > adj2[y]) swap(x, y);
adj2[x] += adj2[y]; adj2[y] = x;
return true;
}
};
/*
Run with Bit<long long> BIT
*/
template <class T> class BIT {
private:
long long size;
vector<T> bit;
vector<T> arr;
public:
BIT(long long size) : size(size), bit(size + 1), arr(size) {}
void set(long long ind, long long val) { add(ind, val - arr[ind]); }
void add(long long ind, long long val) {
arr[ind] += val;
ind++;
for (; ind <= size; ind += ind & -ind) { bit[ind] += val; }
}
T pref_sum(long long ind) {
ind++;
T total = 0;
for (; ind > 0; ind -= ind & -ind) { total += bit[ind]; }
return total;
}
};
/*
Change Comb for specific Seg tree probs, but run with Seg<long long> Seg;
*/
template<class T> struct Seg {
const T ID = 1e18; T comb(T a, T b) { return min(a,b); }
long long n; vector<T> seg;
void init(long long _n) { n = _n; seg.assign(2*n,ID); }
void pull(long long p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
void upd(long long p, T val) {
seg[p += n] = val; for (p /= 2; p; p /= 2) pull(p); }
T query(long long l, long long r) {
T ra = ID, rb = ID;
for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
if (l&1) ra = comb(ra,seg[l++]);
if (r&1) rb = comb(seg[--r],rb);
}
return comb(ra,rb);
}
};
int n, k;
vector<int> v;
vector<pair<int, int> > ans;
void solve(){
int minVal = INT_MAX;
for(int i = 0; i < v.size(); i++){
minVal = min(minVal, v[i]);
}
for(int i = 0; i < v.size(); i++){
v[i] -= minVal;
}
bool works = false;
for(int i = 0; i < v.size(); i++){
if(v[i] >= k){
works = true;
break;
}
}
if(!works){
return;
}
for(int i = 0; i < v.size(); i++){
if(v[i] == 0){
v[i] += k;
ans.push_back(make_pair(1, i + 1));
}
}
int minVal2 = INT_MAX;
for(int i = 0; i < v.size(); i++){
minVal2 = min(minVal2, v[i]);
}
for(int i = 0; i < v.size(); i++){
v[i] -= minVal2;
}
solve();
}
int main(){
IOS;
cin >> n >> k;
for(int i = 0; i < n; i++){
int x;
cin >> x;
v.push_back(x);
}
solve();
for(int i = 1; i < n; i++){
if(v[i] % k == v[i - 1] % k){
continue;
}
if(i % k == 0){
solve();
while(v[i] % k != v[i - 1] % k){
int cur = i - k;
while(cur >= 0){
ans.push_back(make_pair(2, cur + 1));
for(int j = cur; j < cur + k; j++){
v[j]++;
}
cur -= k;
}
int minVal = INT_MAX;
for(int i = 0; i < v.size(); i++){
minVal = min(minVal, v[i]);
}
for(int i = 0; i < v.size(); i++){
v[i] -= minVal;
}
}
continue;
}
if(i + k - 1 >= n){
cout << -1 << "\n";
return 0;
}
while(v[i] % k != v[i - 1] % k){
ans.push_back(make_pair(2, i + 1));
int maxVal = 0;
for(int j = i; j < i + k; j++){
maxVal = max(maxVal, v[j]);
}
for(int j = 0; j < n; j++){
if(!(i <= j && j <= i + k - 1)){
while(v[j] <= maxVal + 1){
v[j] += k;
ans.push_back(make_pair(1, j + 1));
}
v[j]--;
}
}
int minVal = INT_MAX;
for(int i = 0; i < v.size(); i++){
minVal = min(minVal, v[i]);
}
for(int i = 0; i < v.size(); i++){
v[i] -= minVal;
}
}
}
solve();
cout << ans.size() << "\n";
for(int i = 0; i < ans.size(); i++){
cout << ans[i] << "\n";
}
}
Compilation message (stderr)
joiris.cpp: In function 'void solve()':
joiris.cpp:93:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
93 | for(int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
joiris.cpp:96:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
96 | for(int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
joiris.cpp:100:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
100 | for(int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
joiris.cpp:109:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
109 | for(int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
joiris.cpp:116:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
116 | for(int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
joiris.cpp:119:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
119 | for(int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
joiris.cpp: In function 'int main()':
joiris.cpp:149:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
149 | for(int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
joiris.cpp:152:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
152 | for(int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
joiris.cpp:178:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
178 | for(int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
joiris.cpp:181:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
181 | for(int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
joiris.cpp:188:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
188 | for(int i = 0; i < ans.size(); i++){
| ~~^~~~~~~~~~~~
# | 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... |