oj.uz

답안 #750788

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
750788 2023-05-30T10:04:12 Z edogawa_something Mensza (COI22_mensza) C++17
11 / 100
 5000 ms 524288 KB 
#include<bits/stdc++.h>
#include<chrono>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef bool bl;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
typedef vector<pii> vpi;
#define ordered_set tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update>
#define fast ios_base::sync_with_stdio(0);cin.tie();
#define test ll qqqqq;cin>>qqqqq;while(qqqqq--)
#define test1 ll qqqqq=1;while(qqqqq--)
#define F first
#define S second
#define forn(i,n) for(int i=0;i<n;i++)
#define forx(i,j,n) for(int i=j;i<n;i++)
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define all(v) v.begin(),v.end()
#define lb lower_bound
#define ub upper_bound
#define pow powww
#define prtll(x) printf("%lld",x)
#define prtld(x) printf("%Lf",x)
#define prtst(x) printf("%s",x)
#define prtch(x) printf("%c",x)
#define measure chrono::high_resolution_clock::now()
#define duration chrono::duration_cast<chrono::milliseconds>(end-start)
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
const ll dx[]{1,0,-1,0,1,-1,1,-1};
const ll dy[]{0,-1,0,1,1,-1,-1,1};
const ll inf=1e18;
const ll mod=1e9+7;
const ll LM=1e8+1;
const ll M=2e5+10;
const ll MM=4002;
const ll MMM=501;
const ld pi=acos(-1);
//const ll mod=998244353;
ll pow(ll r,ll to,ll m=mod){
  ll res=1;
  r%=m;
  while(to){
    if((to&1)){
      res*=r,res%=m;
    }
    r*=r,r%=m;
    to=(to>>1);
  }
  return res;
}
ll t=1;
int main(){
  fast
  //freopen("gen.txt","r",stdin);
  auto start=measure;
  test1{
    ll n,q;
    cin>>n>>q;
    while(q--){
      string type;
      cin>>type;
      if(type[0]=='a'){
        ll a;
        cin>>a;
        cout<<a<<' ';
        forn(i,a)
        cout<<t<<' ';
        t++;
      }
      else if(type[0]=='b'){
        ll b;
        cin>>b;
        cout<<b<<' ';
        forn(i,b)
        cout<<t++<<' ';
      }
      else{
        ll c;
        cin>>c;
        ll x;
        forn(i,c){
          cin>>x;
        }
        if(x>c-1){
          cout<<"A\n";
        } 
        else{
          cout<<"B\n";
        }
      }
    }
  }
  auto end=measure;
  auto dur=duration;
  //cout<<fixed<<dur.count()<<'\n';
  return 0;
}
/*
*/

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 728 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 96 ms 7100 KB Integer parameter [name=l_221] equals to 111, violates the range [0, 110]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 66.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5002 ms 524288 KB Time limit exceeded
2 Halted 0 ms 0 KB -