oj.uz

Submission #1079335

# Submission time Handle Problem Language Result Execution time Memory
1079335 2024-08-28T13:13:23 Z vnm06 JOIRIS (JOI16_joiris) C++14
30 / 100
 1 ms 604 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;

int n, k, h[64];
vector<pair<int, int> > moves;

void print_ans(bool t)
{
    if(!t)
    {
        cout<<-1<<endl;
        exit(0);
    }
    cout<<moves.size()<<endl;
    for(int i=0; i<moves.size(); i++) cout<<moves[i].first<<" "<<moves[i].second+1<<endl;
    exit(0);
}

int ost[64];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>k;
    for(int i=0; i<n; i++) 
    {
        cin>>h[i];
        ost[i%k]+=h[i];
    }
    for(int i=0; i<k-1; i++) if(ost[i]%k!=ost[i+1]%k) print_ans(0);

    for(int i=n-2; i>=0; i--)
    {
        while(h[i]<h[i+1])
        {
            moves.push_back({1, i});
            h[i]+=k;
        }
    }
    int id=n-1, br=0;
    vector<int> vr, vr2;
    for(int i=h[n-1]+1; i<=h[0]; i++)
    {
        while(id && h[id-1]<i) id--;
        int l=n-id;
        for(int j=id; j<=n-k; j+=k) moves.push_back({2, j});
        if(l%k) vr.push_back(l%k);
    }
    int t=vr.size();
    for(int i=1; i<k; i++)
    {
        for(int s=0; s<vr.size(); s+=k)
        {
            moves.push_back({1, n-i});
            for(int tj=s; tj<s+k; tj++) vr[tj]--;
        }
        vr2.resize(0);
        for(int s=0; s<vr.size(); s++) if(vr[s]) vr2.push_back(vr[s]);
        vr=vr2;
    }
    print_ans(1);
    return 0;
}

Compilation message

joiris.cpp: In function 'void print_ans(bool)':
joiris.cpp:17:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i=0; i<moves.size(); i++) cout<<moves[i].first<<" "<<moves[i].second+1<<endl;
      |                  ~^~~~~~~~~~~~~
joiris.cpp: In function 'int main()':
joiris.cpp:57:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         for(int s=0; s<vr.size(); s+=k)
      |                      ~^~~~~~~~~~
joiris.cpp:63:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         for(int s=0; s<vr.size(); s++) if(vr[s]) vr2.push_back(vr[s]);
      |                      ~^~~~~~~~~~
joiris.cpp:45:17: warning: unused variable 'br' [-Wunused-variable]
   45 |     int id=n-1, br=0;
      |                 ^~
joiris.cpp:54:9: warning: unused variable 't' [-Wunused-variable]
   54 |     int t=vr.size();
      |         ^

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Incorrect 1 ms 348 KB Output isn't correct
18 Halted 0 ms 0 KB -