记录编号	569688	评测结果	AAAAAAAAAA
题目名称	[USACO 2.1] 荷斯坦奶牛	最终得分	100
用户昵称	lihaoze	是否通过	通过
代码语言	C++	运行时间	0.000 s
提交时间	2022-03-14 23:22:34	内存使用	0.00 MiB

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
#define OPEN(_x) freopen(#_x".in", "r", stdin); freopen(#_x".out", "w", stdout)
#define MAX(_a, _b) [&](int __a, int __b) { return __a < __b ? __b : __a; }((_a), (_b))
#define MIN(_a, _b) [&](int __a, int __b) { return __a > __b ? __b : __a; }((_a), (_b))
#define ABS(_x) [&](int __x) { return __x < 0 ? -__x : __x; }(_x)
#define INT(_x) int _x = IO::read<int>();
#define fi first
#define se second 

using ll = long long;
using PII = std::pair<int, int>;

namespace IO {
    template <typename T> inline T read() {
        char ch = getchar();
        T ret = 0, sig = 1;
        while(ch < '0' || ch > '9') { if(ch == '-') sig = -1; ch = getchar(); }
        while(ch >= '0' && ch <= '9') ret *= 10, ret += ch - 48, ch = getchar();
        return ret * sig;
    }
    template <typename T> inline void write(T out) {
		if(!out) { putchar('0'), putchar(' '); return; }
        int stk[100], tt = 0;
        if(out < 0) out = -out, putchar('-');
        while(out) stk[tt++] = out % 10, out /= 10;
        for(register int i = --tt; i>=0; --i) putchar(stk[i] + 48);
        putchar(' ');
    }
    template <typename T> inline void read(T& ret) { ret = IO::read<T>(); }
    template <typename T, typename... Args> inline void read(T& x, Args&... args) { IO::read(x), IO::read(args...); }
    template <typename T, typename... Args> inline void write(T x, Args... args)  { IO::write(x), IO::write(args...); }
};


const int N = 1010, M = 20;
int n, m, mn = 1e9;
int v[N], g[M][N];
int ans[M], chosen[M];

inline bool valid(int x) {
    for(register int i = 1; i<=n; ++i) {
        int s = 0;
        for(register int j = 1; j<=x; ++j) s += g[chosen[j]][i];
        if(s < v[i]) return false;
    }
    return true;
}

void dfs(int a, int b) {
    if(a == m + 1) {
        if(valid(b) && b < mn) {
            mn = b;
            for(register int i = 1; i<=mn; ++i) ans[i] = chosen[i];
        }
        return;
    }
    chosen[b+1] = a;
    dfs(a+1, b+1);
    chosen[b+1] = 0;
    dfs(a+1, b);
}

int main() {
    #ifdef DEBUG
    OPEN(test);
    #endif
    OPEN(holstein);
    IO::read(n);
    for(register int i = 1; i<=n; ++i) IO::read(v[i]);
    IO::read(m);
    for(register int i = 1; i<=m; ++i) 
        for(register int j = 1; j<=n; ++j) 
            IO::read(g[i][j]);
    dfs(1, 0);
    IO::write(mn);
    for(register int i = 1; i<=mn; ++i) IO::write(ans[i]);
    return 0;
}