oj.uz

Submission #1079366

# Submission time Handle Problem Language Result Execution time Memory
1079366 2024-08-28T13:31:49 Z vnm06 JOIRIS (JOI16_joiris) C++14
45 / 100
 1 ms 456 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 rm;
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];
    }
    rm=n%k;
    if(rm!=0)
    {
        for(int i=0; i<rm-1; i++) if(ost[i]%k!=ost[i+1]%k) print_ans(0);
        for(int i=rm; i<k-1; i++) if(ost[i]%k!=ost[i+1]%k) print_ans(0);

    }
    else
    {
        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++) 
            {
                if(tj>=vr.size()) vr.push_back(n);
                vr[tj]--;
            }
        }
        vr2.resize(0);
        for(int s=0; s<vr.size(); s++) if(vr[s]) vr2.push_back(vr[s]);
        vr=vr2;
    }
    for(int i=0; i<vr.size(); i++)
    {
        for(int j=vr[i]-k; j>=0; j-=k)
        {
            moves.push_back({2, j});
            vr[i]-=k;
        }
    }
    vr2.resize(0);
    for(int s=0; s<vr.size(); s++) if(vr[s]) vr2.push_back(vr[s]);
    vr=vr2;
    
    while(vr.size()%k)
    {
        vr.push_back(n-k);
        moves.push_back({2, n-k});
    }
    int ts=vr.size()/k;
    for(int i=0; i<n-k; i++)
    {
        for(int j=0; j<ts; j++) moves.push_back({1, i});
    }
    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:67:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for(int s=0; s<vr.size(); s+=k)
      |                      ~^~~~~~~~~~
joiris.cpp:72:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |                 if(tj>=vr.size()) vr.push_back(n);
      |                    ~~^~~~~~~~~~~
joiris.cpp:77:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |         for(int s=0; s<vr.size(); s++) if(vr[s]) vr2.push_back(vr[s]);
      |                      ~^~~~~~~~~~
joiris.cpp:80:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for(int i=0; i<vr.size(); i++)
      |                  ~^~~~~~~~~~
joiris.cpp:89:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |     for(int s=0; s<vr.size(); s++) if(vr[s]) vr2.push_back(vr[s]);
      |                  ~^~~~~~~~~~
joiris.cpp:55:17: warning: unused variable 'br' [-Wunused-variable]
   55 |     int id=n-1, br=0;
      |                 ^~
joiris.cpp:64:9: warning: unused variable 't' [-Wunused-variable]
   64 |     int t=vr.size();
      |         ^

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 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
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 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 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 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 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 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 0 ms 348 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 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 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 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 0 ms 348 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 348 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 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Incorrect 0 ms 348 KB Output isn't correct
58 Halted 0 ms 0 KB -