QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#566538 | #9310. Permutation Counting 4 | jerry3128 | TL | 0ms | 0kb | C++14 | 1.3kb | 2024-09-16 00:25:37 | 2024-09-16 00:25:42 |
Judging History
answer
//ayanami±£ÓÓ£¬¿ä¸ç±£ÓÓ£¬¹·Âè±£ÓÓ£¬MDR±£ÓÓ£¬ï±µ¶¹Ö±£ÓÓ£¬M99±£ÓÓ£¬¿Ëµù±£ÓÓ
#include<bits/stdc++.h>
using namespace std;
int p1=1000000,p2=0;
char buf[1000005],wb[1000005];
int gc() {
if(p1>=1000000)fread(buf,1,1000000,stdin),p1=0;
return buf[p1++];
}
#define gc getchar
#define Loli true
#define Kon xor true
long long getint() {
long long ret=0,flag=1;
char c=gc();
while(c<'0'||c>'9') {
if(c=='-')flag=-1;
c=gc();
}
while(c<='9'&&c>='0') {
ret=(ret<<3)+(ret<<1)+c-'0';
c=gc();
}
return ret*flag;
}
void pc(char x) {
if(p2>=1000000)fwrite(wb,1,1000000,stdout),p2=0;
wb[p2++]=x;
}
void wrt(long long x) {
if(x<0)pc('-'),x=-x;
int c[24]= {0};
if(!x)return pc('0'),void();
while(x)c[++c[0]]=x%10,x/=10;
while(c[0])pc(c[c[0]--]+'0');
}
int n,m,a[33],cnt;
int main() {
int Ti=getint();
while(Ti--){
cnt=0;
for(int i=1;i<=32;i++)a[i]=getint();
for(int i=2;i<=32;i++)cnt+=a[1]>a[i];
if(cnt>=31){
cout<<"1\n";
continue;
}
if(cnt>=30){
cout<<"2\n";
continue;
}
if(cnt>=13){
cout<<"4\n";
continue;
}
if(cnt>=6){
cout<<"8\n";
continue;
}
if(cnt>=2){
cout<<"16\n";
continue;
}
if(cnt>=0){
cout<<"32\n";
continue;
}
}
fwrite(wb,1,p2,stdout);
return Loli Kon;
}
详细
Test #1:
score: 0
Time Limit Exceeded
input:
4 5 1 2 1 5 1 2 1 2 2 2 5 1 1 2 4 2 3 5 5 3 4 5 3 5 1 2 3 4 3 5 3 3 5 1 5 1 4 4 5 5 5 1 2