QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#567240#9308. World CupDa_CapoWA 1ms3660kbC++201.5kb2024-09-16 10:28:072024-09-16 10:28:07

Judging History

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

  • [2024-09-16 10:28:07]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3660kb
  • [2024-09-16 10:28:07]
  • 提交

answer

# include <bits/stdc++.h>

# define IO ios::sync_with_stdio(0);
# define Icin cin.tie(0);cout.tie(0);
# define int long long
# define fi first
# define se second
# define endl "\n"
# define pb push_back
# define rep(i,a,b) for(int i=a;i<=b;i++)
# define lowbit(x) ((x) & (-x))

using namespace std;

typedef long double ld;
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, string> PIS;
typedef pair<ld, int> PDI;

const int N = 1e5 + 10, M = N * 2;
const int mod = 1e9 + 7, inf = 1e16, INF = 1e16, MOD = 998244353;

int n, m, k;
//int q;
int dx[4] = {1, 0, 0, -1}, dy[4] = {0, -1, 1, 0} ;
//int a[N], b[N], c[N];
int a, b, c;
int x, y, z;
vector<PDI> v[N];
int w[N];
//char s[N];
string s;

struct node {
	int id, q;
} d[100];

bool cmp(node a, node b) {
	if (a.q != b.q) return a.q > b.q;
	return 0;
}

void solve() {


	for (int i = 1 ;  i <= 32 ; i ++ ) {
		cin >> d[i].q;
		d[i].id = i;
	}
	sort(d + 1, d + 1 + 32, cmp);

	int idx = 0;
	for (int i = 1 ; i <= 32 ; i ++ )
		if (d[i].id == 1)
			idx = i;

	if (idx == 1) cout << 1 << endl;
	else if (idx >= 2 && idx <= 17)cout << 2 << endl;
	else if (idx >= 18 && idx <= 27)cout << 4 << endl;
	else if (idx >= 28 && idx <= 30)cout << 16 << endl;
	else cout << 32 << endl;

}

signed main() {
	IO;
	Icin;

	int t = 1;
	cin >> t;
	cout << fixed << setprecision(2);

	while (t--) {
		solve();
	}

	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3660kb

input:

1
32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1

output:

1

result:

ok 1 number(s): "1"

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 3584kb

input:

32
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
3 1 2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
4 1 2 3 5 6 7 8 9 10 11 12 13 14 15 ...

output:

32
32
16
16
16
4
4
4
4
4
4
4
4
4
4
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1

result:

wrong answer 6th numbers differ - expected: '16', found: '4'