제출 #1153510

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1153510		modwwe	Ancient Machine (JOI21_ancient_machine)	C++20	0 / 100	36 ms	6456 KiB

Anna

//#include "gap.h"
//#include "mushrooms.h"
//#include "island.h"
#include "Anna.h"
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r)
{
    return uniform_int_distribution<int>(l,r)(rd);
}
void phongbeo();
const int inf = 1e16;
const ll mod2 = 1e9+7;
const ll base=67;
int  n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
int kk;
int t;
int el = 19;
bool c[100001];
void Anna(int n,vector<char>a)
{
    bool de=0;
for(int i=0;i<a.size();i++)
{
if(!de&&i!=a.size()-1&&a[i+1]=='X')continue;
if(de&&i!=a.size()-1&&a[i+1]=='Z') continue;
 if(!de&&a[i]=='X')
 {
     c[i]=1;
     de=1;
     i++;
 }
 else  if(de&&a[i]=='Z')
     c[i]=1;
}
for(int i=0;i<n;i++)
    Send(c[i]);
}

Bruno

//#include "gap.h"
//#include "mushrooms.h"
//#include "island.h"
#include "Bruno.h"
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r)
{
    return uniform_int_distribution<int>(l,r)(rd);
}
void phongbeo();
const int inf = 1e16;
const ll mod2 = 1e9+7;
const ll base=67;
int  n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
int kk;
int t;
int el = 19;
vector<int> v;
void Bruno(int n,int L,vector<int> a)
{
    v.pb(-1);
    for(int i=0;i<a.size();i++)
        if(a[i]==1)
            v.pb(i);
            if(v.back()!=n-1)
            v.pb(n-1);
 for(int i=1;i<v.size();i++)
 {
     for(int j=v[i]-1;j>v[i-1];--j)
        Remove(j);
        if(i==1) continue;
     Remove(v[i]);
 }
 Remove(v[1]);
}

컴파일 시 표준 에러 (stderr) 메시지

# 1번째 컴파일 단계

Anna.cpp:29:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+16' to '2147483647' [-Woverflow]
   29 | const int inf = 1e16;
      |                 ^~~~

# 2번째 컴파일 단계

Bruno.cpp:29:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+16' to '2147483647' [-Woverflow]
   29 | const int inf = 1e16;
      |                 ^~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 95