oj.uz

답안 #364228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364228 2021-02-08T12:53:50 Z Ahmadsm2005 Mouse (info1cup19_mouse) C++14
5.99999 / 100
 139 ms 364 KB 
#include <bits/stdc++.h>
#include "grader.h"
//#define endl '\n'
#define modulo 1000000007
//#define int long long
#define PI acos(-1)
#pragma GCC optimize("-Ofast")
//#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")
#define sinDegrees(x) sin((x) * PI / 180.0)
#define cosDegrees(x) cos((x) * PI / 180.0)
#define tanDegrees(x) tan((x) * PI / 180.0)
#define atanDegrees(x) atan(x)* 180.0 / PI
#define asinDegrees(x) asin(x)* 180.0 / PI
#define EPS 0.000000001
using namespace std;
int power(int x,int y,int m)
{
int temp;
if(y == 0)
return 1;
temp = (power(x, y/2,m))%m;
if (y%2 == 0)
return ((temp%m)*temp);
else
return ((x*temp%m)*temp%m)%m;
}
int inv(int x,int m=modulo)
{
return (power(x,m-2,m))%m;
}
///IOI 2021 isA
bool freq[257];
void solve(int N){
vector<int>lolz;
for(int i=0;i<N;i++)
lolz.push_back(i+1);
if(query(lolz)==N)
return;
while(next_permutation(lolz.begin(),lolz.end())){
if(query(lolz)==N)
return;
}
}
/*int32_t main()
{
//freopen("output.txt","w",stdout);
//freopen("sorting.in","r",stdin);
cin.tie(0),iostream::sync_with_stdio(0);

return 0;
}*/

Subtask #1
5.999994 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 364 KB Correct! Number of queries: 3487
2 Correct 1 ms 364 KB Correct! Number of queries: 18
3 Correct 4 ms 364 KB Correct! Number of queries: 328
4 Correct 33 ms 364 KB Correct! Number of queries: 3528
5 Correct 52 ms 364 KB Correct! Number of queries: 4783
6 Correct 2 ms 364 KB Correct! Number of queries: 88

Subtask #2
0.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 364 KB Correct! Number of queries: 3487
2 Correct 1 ms 364 KB Correct! Number of queries: 18
3 Correct 4 ms 364 KB Correct! Number of queries: 328
4 Correct 33 ms 364 KB Correct! Number of queries: 3528
5 Correct 52 ms 364 KB Correct! Number of queries: 4783
6 Correct 2 ms 364 KB Correct! Number of queries: 88
7 Runtime error 139 ms 364 KB Execution killed with signal 13
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 364 KB Correct! Number of queries: 3487
2 Correct 1 ms 364 KB Correct! Number of queries: 18
3 Correct 4 ms 364 KB Correct! Number of queries: 328
4 Correct 33 ms 364 KB Correct! Number of queries: 3528
5 Correct 52 ms 364 KB Correct! Number of queries: 4783
6 Correct 2 ms 364 KB Correct! Number of queries: 88
7 Runtime error 139 ms 364 KB Execution killed with signal 13
8 Halted 0 ms 0 KB -