QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#567255 | #9308. World Cup | Da_Capo | WA | 1ms | 3616kb | C++20 | 1.5kb | 2024-09-16 10:37:07 | 2024-09-16 10:37:08 |
Judging History
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;
cout << idx << endl;
if (idx == 1) cout << 1 << endl;
else if (idx >= 2 && idx <= 17)cout << 2 << endl;
else if (idx >= 18 && idx <= 25)cout << 4 << endl;
else if (idx >= 26 && 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;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3616kb
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 1
result:
wrong answer Output contains longer sequence [length = 2], but answer contains 1 elements