Submission #53828864


Source Code Expand

Copy
#include<bits/stdc++.h>
//#pragma GCC optimize("O3") // optimization
//#pragma GCC optimize("Ofast") // optimization
//#pragma GCC optimize("unroll-loops") // optimization
using namespace std;
#define i32 signed
#define int long long // CP
#define i64 long long
#define endl '\n'
#define elif else if
#define fi first
#define se second
#define pb push_back
#define p32 pair<i32,i32>
#define p64 pair<i64,i64>
#define f2(i,x) for((i)=0;(i)<(x);(i)++)
#define f2b(i,x) for((i)=(x)-1;(i)>=0;(i)--)
#define f3(i,f,t) for((i)=(f);(i)<(t);(i)++)
#define fall(x) (x).begin(), (x).end()
#define sort1(x) sort(fall(x))
#define rev(x) reverse(fall(x))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include<bits/stdc++.h>
//#pragma GCC optimize("O3") // optimization
//#pragma GCC optimize("Ofast") // optimization
//#pragma GCC optimize("unroll-loops") // optimization
using namespace std;
#define i32 signed
#define int long long // CP
#define i64 long long
#define endl '\n'
#define elif else if
#define fi first
#define se second
#define pb push_back
#define p32 pair<i32,i32>
#define p64 pair<i64,i64>
#define f2(i,x) for((i)=0;(i)<(x);(i)++)
#define f2b(i,x) for((i)=(x)-1;(i)>=0;(i)--)
#define f3(i,f,t) for((i)=(f);(i)<(t);(i)++)
#define fall(x) (x).begin(), (x).end()
#define sort1(x) sort(fall(x))
#define rev(x) reverse(fall(x))
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fl fflush(stdout)
#define nl cout<<endl;fflush(stdout)
i64 gcd(i64 a, i64 b){if(a<b){a=a^b;b=a^b;a=a^b;} return b==0?a:gcd(b,a%b);}
i64 lcm(i64 a, i64 b){return a/gcd(a,b)*b;}
i64 expm(i64 a, i64 b, i64 m){i64 r=1;while(b){if(b&1)r=r*a%m;a=a*a%m;b>>=1;}return r%m;}
i64 expm(i64 a, i64 b){i64 r=1,m=1e9+7;while(b){if(b&1)r=r*a%m;a=a*a%m;b>>=1;}return r%m;}
i64 minv(i64 a, i64 m){return expm(a,m-2,m);}
i64 ncrm(i64 n, i64 r, i64 m){i64 i,j,k; i64 out=1; f3(i,1,n+1){out*=i;out%=m;}f3(i,1,r+1){out*=minv(i,m);out%=m;}f3(i,1,n-r+1){out*=minv(i,m);out%=m;}return out%m;}
int n,m,k,a[300010],b[300010]; char c[300010];
void f(){
    int i,j,l;
    cin>>n>>m; vector<p64>a(n+m);
    f2(i,n)cin>>a[i].fi,a[i].se=1;
    f2(i,m)cin>>a[n+i].fi,a[n+i].se=2;
    sort(fall(a));
    f2(i,n+m-1)if(a[i].se==1&&a[i+1].se==1){
        cout<<"Yes\n"; return;
    } cout<<"No\n";
}
i32 main(){
    fast;
//    int tc; cin>>tc;
//    while(tc--)f();
    f();
    return 0;
}

Submission Info

Submission Time
Task B - Piano 2
User annyeong1
Language C++ 17 (gcc 12.2)
Score 200
Code Size 1714 Byte
Status AC
Exec Time 1 ms
Memory 3600 KB

Compile Error

Main.cpp: In function ‘long long int ncrm(long long int, long long int, long long int)’:
Main.cpp:30:37: warning: unused variable ‘j’ [-Wunused-variable]
   30 | i64 ncrm(i64 n, i64 r, i64 m){i64 i,j,k; i64 out=1; f3(i,1,n+1){out*=i;out%=m;}f3(i,1,r+1){out*=minv(i,m);out%=m;}f3(i,1,n-r+1){out*=minv(i,m);out%=m;}return out%m;}
      |                                     ^
Main.cpp:30:39: warning: unused variable ‘k’ [-Wunused-variable]
   30 | i64 ncrm(i64 n, i64 r, i64 m){i64 i,j,k; i64 out=1; f3(i,1,n+1){out*=i;out%=m;}f3(i,1,r+1){out*=minv(i,m);out%=m;}f3(i,1,n-r+1){out*=minv(i,m);out%=m;}return out%m;}
      |                                       ^
Main.cpp: In function ‘void f()’:
Main.cpp:33:11: warning: unused variable ‘j’ [-Wunused-variable]
   33 |     int i,j,l;
      |           ^
Main.cpp:33:13: warning: unused variable ‘l’ [-Wunused-variable]
   33 |     int i,j,l;
      |             ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 20
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_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 02_handmade_01.txt, 02_handmade_02.txt, 02_handmade_03.txt, 02_handmade_04.txt, 02_handmade_05.txt, 02_handmade_06.txt, 02_handmade_07.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 3452 KB
00_sample_02.txt AC 1 ms 3464 KB
00_sample_03.txt AC 1 ms 3468 KB
01_random_01.txt AC 1 ms 3420 KB
01_random_02.txt AC 1 ms 3480 KB
01_random_03.txt AC 1 ms 3492 KB
01_random_04.txt AC 1 ms 3528 KB
01_random_05.txt AC 1 ms 3460 KB
01_random_06.txt AC 1 ms 3444 KB
01_random_07.txt AC 1 ms 3460 KB
01_random_08.txt AC 1 ms 3524 KB
01_random_09.txt AC 1 ms 3472 KB
01_random_10.txt AC 1 ms 3288 KB
02_handmade_01.txt AC 1 ms 3424 KB
02_handmade_02.txt AC 1 ms 3428 KB
02_handmade_03.txt AC 1 ms 3484 KB
02_handmade_04.txt AC 1 ms 3508 KB
02_handmade_05.txt AC 1 ms 3420 KB
02_handmade_06.txt AC 1 ms 3600 KB
02_handmade_07.txt AC 1 ms 3424 KB


2025-03-09 (Sun)
13:44:26 +00:00