提出 #41946748


ソースコード 拡げる

/*  
  hmz is the most cute girl in this world!
--------------------------------------------
  You've got to have faith
  Don't let them cut you down cut you down once more
*/
#include<bits/stdc++.h>
using namespace std;
#define TY int
#define IL inline
#define umap unordered_map
#define ull unsigned long long
#define pq priority_queue
#define mp make_pair
#define pb push_back
#define mod (TY)(1e9+7)
#define MAXN 200005
#define MAXM 200005
#define MAXK 27
#define INF (TY)(1e9)
#define block 300
#define For(i,a,b) for(TY i=(a);i<=(b);++i)
#define FOR(i,a,b) for(TY i=(a);i<(b);++i)
#define Rof(i,a,b) for(TY i=(a);i>=(b);--i)
#define ROF(i,a,b) for(TY i=(a);i>(b);--i)
IL TY qr(){
	TY x=0,f=1;char op=getchar();
	for(;op<'0'||op>'9';op=getchar())if(op=='-')f=-1;
	for(;op>='0'&&op<='9';op=getchar())x=x*10+(op^48);
	return x*f;
}IL bool ischar(char op){
	if(op>='a'&&op<='z')return true;
	if(op>='A'&&op<='Z')return true;
	return false;
}IL char getc(){
	char op=getchar();
	while(!ischar(op))op=getchar();
	return op;
}IL string qs(){
	string op="";char u=getchar();
	while(!ischar(u))u=getchar();
	while(ischar(u))op+=u,u=getchar();
	return op;
}IL void qw(TY x){
	if(!x){putchar('0');return;}
	if(x<0)putchar('-'),x=-x;
	if(x>=10)qw(x/10);putchar(x%10+'0');
}IL void qw(TY x,char op){qw(x),putchar(op);}
IL void ws(string s){FOR(i,0,s.size())putchar(s[i]);}
IL TY Ceil(TY a,TY b){return a/b+(a%b!=0);}
IL TY Mod(TY a){return (a>=mod?a-mod:a);}
IL TY Abs(TY a,TY b){return a>b?a-b:b-a;}
IL TY Pow(TY a,TY b){
	TY ans=1,base=a;
	while(b){
		if(b&1)ans=ans*base%mod;
		base=base*base%mod;b>>=1;
	}return ans;
}TY w,h,n,A,B,a[MAXN],b[MAXN],p[MAXN],q[MAXN];
map<TY,map<TY,TY> > cnt;
int main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	w=qr();h=qr();n=qr();
	For(i,1,n)p[i]=qr(),q[i]=qr();
	A=qr();For(i,1,A)a[i]=qr();
	B=qr();For(i,1,B)b[i]=qr();
	a[++A]=w;b[++B]=h;
	/* init */
	TY have=0,minn=INF,maxx=-INF;
	For(i,1,n){
		TY fir=lower_bound(a+1,a+1+A,p[i])-a,sec=lower_bound(b+1,b+1+B,q[i])-b;
		if(!cnt[fir][sec])++have;
		++cnt[fir][sec];maxx=max(maxx,cnt[fir][sec]);
	}For(i,1,n){
		TY fir=lower_bound(a+1,a+1+A,p[i])-a,sec=lower_bound(b+1,b+1+B,q[i])-b;
		minn=min(minn,cnt[fir][sec]);
	}if(1ll*have!=1ll*A*B)minn=0;
	qw(minn,' '),qw(maxx,'\n');
    return 0;
}

提出情報

提出日時
問題 D - A Piece of Cake
ユーザ hmzqwq
言語 C++ (GCC 9.2.1)
得点 400
コード長 2372 Byte
結果 AC
実行時間 426 ms
メモリ 34768 KiB

コンパイルエラー

./Main.cpp: In function ‘void qw(int)’:
./Main.cpp:47:2: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   47 |  if(x>=10)qw(x/10);putchar(x%10+'0');
      |  ^~
./Main.cpp:47:20: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   47 |  if(x>=10)qw(x/10);putchar(x%10+'0');
      |                    ^~~~~~~
./Main.cpp: In function ‘void ws(std::string)’:
./Main.cpp:23:34: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   23 | #define FOR(i,a,b) for(TY i=(a);i<(b);++i)
      |                                  ^
./Main.cpp:49:22: note: in expansion of macro ‘FOR’
   49 | IL void ws(string s){FOR(i,0,s.size())putchar(s[i]);}
      |                      ^~~

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 2
AC × 45
セット名 テストケース
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, example0.txt, example1.txt
ケース名 結果 実行時間 メモリ
000.txt AC 42 ms 5080 KiB
001.txt AC 30 ms 4976 KiB
002.txt AC 26 ms 4916 KiB
003.txt AC 33 ms 5092 KiB
004.txt AC 33 ms 4916 KiB
005.txt AC 220 ms 14188 KiB
006.txt AC 236 ms 14700 KiB
007.txt AC 317 ms 24084 KiB
008.txt AC 424 ms 34600 KiB
009.txt AC 417 ms 34732 KiB
010.txt AC 426 ms 34708 KiB
011.txt AC 44 ms 6584 KiB
012.txt AC 51 ms 6432 KiB
013.txt AC 53 ms 6528 KiB
014.txt AC 53 ms 6652 KiB
015.txt AC 219 ms 18680 KiB
016.txt AC 208 ms 18724 KiB
017.txt AC 212 ms 18560 KiB
018.txt AC 211 ms 18560 KiB
019.txt AC 400 ms 34768 KiB
020.txt AC 50 ms 6500 KiB
021.txt AC 93 ms 11632 KiB
022.txt AC 194 ms 16680 KiB
023.txt AC 260 ms 15844 KiB
024.txt AC 355 ms 20100 KiB
025.txt AC 184 ms 16700 KiB
026.txt AC 422 ms 27708 KiB
027.txt AC 419 ms 27764 KiB
028.txt AC 422 ms 27816 KiB
029.txt AC 422 ms 27740 KiB
030.txt AC 414 ms 27728 KiB
031.txt AC 136 ms 5972 KiB
032.txt AC 107 ms 5204 KiB
033.txt AC 91 ms 5112 KiB
034.txt AC 59 ms 5064 KiB
035.txt AC 49 ms 5096 KiB
036.txt AC 43 ms 5096 KiB
037.txt AC 38 ms 5092 KiB
038.txt AC 52 ms 5052 KiB
039.txt AC 40 ms 4872 KiB
040.txt AC 43 ms 5060 KiB
041.txt AC 37 ms 5156 KiB
042.txt AC 38 ms 5052 KiB
example0.txt AC 2 ms 3484 KiB
example1.txt AC 2 ms 3536 KiB