oj.uz

답안 #288012

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288012 2020-09-01T07:51:19 Z 문홍윤(#5789) JOIRIS (JOI16_joiris) C++17
0 / 100
 1 ms 384 KB 
#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 main(){
    scanf("%d %d", &n, &k);
    for(int i=1; i<=n; i++)scanf("%d", &arr[i]);
    for(int i=2; i<=n; i++){
        while(arr[i]<arr[i-1]){
            arr[i]+=k;
            put_vert(i);
        }
    }
    for(int i=1; i<=2500; 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;
    int cut=n%k;
    if(!cut)cut=k-1;
    for(int i=cut+1; i<k; i++){
        if(arr[i]%k)return !printf("-1");
        mx=max(mx, arr[i]);
    }
    for(int i=cut+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<=cut; i++){
        if(arr[i]%k!=arr[1]%k)return !printf("-1");
        mx=max(mx, arr[i]);
    }
    for(int i=1; i<=cut; 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=cut+1; j<=n; j+=k){
            put_hori(j);
            for(int j2=j; j2<j+k; j2++)arr[j2]++;
        }
    }
    erase_lin();
}

Compilation message

joiris.cpp: In function 'int main()':
joiris.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
joiris.cpp:31:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |     for(int i=1; i<=n; i++)scanf("%d", &arr[i]);
      |                            ~~~~~^~~~~~~~~~~~~~~
joiris.cpp:47:17: warning: 'l' may be used uninitialized in this function [-Wmaybe-uninitialized]
   47 |             if(l-k+1<=0)break;
      |                ~^~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -