Submission #71826920


Source Code Expand

#include<bits/stdc++.h>
#include<unordered_map>
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fi first
#define se second
using namespace std;

#define int long long

//namespace io{const int __SIZE=(1<<21)+1;char ibuf[__SIZE],*iS,*iT,obuf[__SIZE],*oS=obuf,*oT=oS+__SIZE-1,__c,qu[55];int __f,qr,_eof;
//#define Gc()(iS==iT?(iT=(iS=ibuf)+fread(ibuf,1,__SIZE,stdin),(iS==iT?EOF:*iS++)):*iS++)
//	inline void flush(){fwrite(obuf,1,oS-obuf,stdout),oS=obuf;}inline void gc(char&x){x=Gc();}inline void pc(char x){*oS++=x;if(oS==oT)flush();}inline void pstr(const char*s){int __len=strlen(s);for(__f=0;__f<__len;++__f)pc(s[__f]);}inline void gstr(char*s){for(__c=Gc();__c<32||__c>126||__c==' ';)__c=Gc();for(;__c>31&&__c<127&&__c!=' '&&__c!='\n'&&__c!='\r';++s,__c=Gc())*s=__c;*s=0;}template<class I>inline bool gi(I&x){_eof=0;for(__f=1,__c=Gc();(__c<'0'||__c>'9')&&!_eof;__c=Gc()){if(__c=='-')__f=-1;_eof|=__c==EOF;}for(x=0;__c<='9'&&__c>='0'&&!_eof;__c=Gc())x=x*10+(__c&15),_eof|=__c==EOF;x*=__f;return!_eof;}template<class I>inline void print(I x){if(!x)pc('0');if(x<0)pc('-'),x=-x;while(x)qu[++qr]=x%10+'0',x/=10;while(qr)pc(qu[qr--]);}struct Flusher_{~Flusher_(){flush();}}io_flusher_;}using io::pc;using io::gc;using io::pstr;using io::gstr;using io::gi;using io::print;
//
template<typename T>ostream&operator<<(ostream&os,const vector<T>&v){os<<"{ ";string sep;for(const auto&x:v)os<<sep<<x,sep=", ";return os<<" }";}
template<typename T,size_t size>ostream&operator<<(ostream&os,const array<T,size>&arr){os<<"{ ";string sep;for(const auto&x:arr)os<<sep<<x,sep=", ";return os<<" }";}
template<typename A,typename B>ostream&operator<<(ostream&os,const pair<A,B>&p){return os<<'('<<p.first<<","<<p.second<<')';}
template<typename K,typename V>ostream&operator<<(ostream&os,const map<K,V>&m){os<<"{ ";string sep;for(const auto&p:m)os<<sep<<p.first<<":"<<p.second,sep=", ";return os<<" }";}
template<typename T>ostream&operator<<(ostream&os,const set<T>&s){os<<"{ ";string sep;for(const auto&x:s)os<<sep<<x,sep=", ";return os<<" }";}
namespace detail{size_t sw(const char*s,size_t len,size_t pos){while(pos<len&&(s[pos]==' '||s[pos]=='\t')){pos++;}return pos;}string gan(const char*names,size_t n){size_t len=strlen(names);size_t pos=0;size_t arg_index=0;while(pos<len){pos=sw(names,len,pos);if(pos>=len)break;size_t arg_end=pos;while(arg_end<len&&names[arg_end]!=','){arg_end++;}if(arg_index==n){size_t trim_end=arg_end;while(trim_end>pos&&(names[trim_end-1]==' '||names[trim_end-1]=='\t')){trim_end--;}return string(names+pos,trim_end-pos);}arg_index++;pos=arg_end+1;}return"";}template<size_t I,typename Arg>void psa(const char*names,Arg&&arg,bool is_last){cerr<<gan(names,I)<<"="<<forward<Arg>(arg);if(!is_last){cerr<<", ";}}template<size_t...I,typename...Args>void pai(const char*names,index_sequence<I...>,Args&&...args){using expand=int[];(void)expand{0,(psa<I>(names,forward<Args>(args),(I==sizeof...(Args)-1)),0)...};}inline void pas(const char*,const char*s){cerr<<s;}template<typename Arg>typename enable_if<!is_same<typename remove_cv<typename remove_reference<Arg>::type>::type,const char*>::value>::type pas(const char*names,Arg&&arg){using IndexSeq=make_index_sequence<1>;pai(names,IndexSeq{},forward<Arg>(arg));}template<typename Arg1,typename Arg2,typename...Args>void pas(const char*names,Arg1&&arg1,Arg2&&arg2,Args&&...args){constexpr size_t arg_count=2+sizeof...(Args);using IndexSeq=make_index_sequence<arg_count>;pai(names,IndexSeq{},forward<Arg1>(arg1),forward<Arg2>(arg2),forward<Args>(args)...);}}
#ifdef LOCAL
#define dbg(...)do{cerr<<"Line "<<__LINE__<<" : ";detail::pas(#__VA_ARGS__,__VA_ARGS__);cerr<<endl;}while(0)
#else
#define dbg(...)
#endif

const int N=1010;

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	
	int a,b;
	cin>>a>>b;
	cout<<a*12+b;
	
	return 0;
}

Submission Info

Submission Time
Task A - Feet
User zhchz
Language C++ IOI-Style(GNU++20) (GCC 14.2.0)
Score 100
Code Size 3955 Byte
Status AC
Exec Time 1 ms
Memory 1676 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 11
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt
All 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 1 ms 1676 KiB
00-sample-02.txt AC 1 ms 1676 KiB
00-sample-03.txt AC 0 ms 1676 KiB
01-01.txt AC 0 ms 1676 KiB
01-02.txt AC 0 ms 1676 KiB
01-03.txt AC 1 ms 1676 KiB
01-04.txt AC 0 ms 1676 KiB
01-05.txt AC 0 ms 1676 KiB
01-06.txt AC 0 ms 1676 KiB
01-07.txt AC 1 ms 1676 KiB
01-08.txt AC 0 ms 1676 KiB