QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#94646#4375. StringzyoobnWA 0ms3616kbC++20674b2023-04-07 12:19:152023-04-07 12:19:19

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-04-07 12:19:19]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3616kb
  • [2023-04-07 12:19:15]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

using i64 = long long;


void solve() {
	int n, m;
	cin >> n >> m;
	vector<array<int, 2>> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i][0] >> a[i][1];
	}
	vector dp(1024, bitset<1024>(0));
	dp[0][0] = 1;
	for (auto &[v, w] : a) {
		for (int i = 0; i < (1 << 10); ++i) {
			dp[i] |= (dp[i ^ w] << v);
		} 
	}
	for (int i = (1 << 10) - 1; i > 0; --i) {
		if (dp[i][m]) {
			cout << i << '\n';
			return;
		}
	}
	cout << 1 << '\n';
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3616kb

input:

10
kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk...

output:

1
1
1
1
1
1
1
1
1
1

result:

wrong answer 1st lines differ - expected: '811844748', found: '1'