제출 #68102

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
68102		duality	JOIRIS (JOI16_joiris)	C++11	0 / 100	3 ms	620 KiB

joiris

#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;

int A[50];
vpii sol;
int norm(int N,int K) {
    int i;
    while (1) {
        for (i = 0; i < N; i++) {
            if (A[i] >= K) break;
        }
        if (i < N) {
            int m = 99;
            for (i = 0; i < N; i++) {
                if (A[i] == 0) {
                    sol.pb(mp(1,i+1));
                    A[i] += K;
                }
                m = min(m,A[i]);
            }
            for (i = 0; i < N; i++) A[i] -= m;
        }
        else break;
    }
    return 0;
}
int diff[60];
int main() {
    int i;
    int N,K;
    scanf("%d %d",&N,&K);
    for (i = 0; i < N; i++) scanf("%d",&A[i]);

    int j;
    norm(N,K);
    for (i = 0; i <= N; i++) {
        if (i == 0) diff[i] = -A[i];
        else if (i == N) diff[i] = A[N-1];
        else diff[i] = A[i-1]-A[i];
    }
    for (i = 0; i < K; i++) {
        int s = 0;
        for (j = i; j <= N; j += K) s += diff[j];
        s %= K;
        if (s != 0) break;
    }
    if (i < K) {
        printf("-1\n");
        return 0;
    }
    for (i = 0; i <= N-K; i++) {
        int m = 0;
        for (j = i; j < i+K; j++) m = max(m,A[j]);
        int x = (diff[i]+K) % K;
        for (j = 0; j < x; j++) sol.pb(mp(2,i+1));
        diff[i+K] += diff[i];
        m += x;
        for (j = 0; j < N; j++) {
            if ((j < i) || (j >= i+K)) {
                while (A[j] < m) sol.pb(mp(1,j+1)),A[j] += K;
            }
            else A[j] += x;
        }
        m = 1e9;
        for (j = 0; j < N; j++) m = min(m,A[j]);
        for (j = 0; j < N; j++) A[j] -= m;
        norm(N,K);
    }
    printf("%d\n",sol.size());
    for (i = 0; i < sol.size(); i++) printf("%d %d\n",sol[i].first,sol[i].second);

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

joiris.cpp: In function 'int main()':
joiris.cpp:74:29: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<std::pair<int, int> >::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n",sol.size());
                   ~~~~~~~~~~^
joiris.cpp:75:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < sol.size(); i++) printf("%d %d\n",sol[i].first,sol[i].second);
                 ~~^~~~~~~~~~~~
joiris.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&K);
     ~~~~~^~~~~~~~~~~~~~~
joiris.cpp:37:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d",&A[i]);
                             ~~~~~^~~~~~~~~~~~

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 55