Codeforces Round #317 [AimFund Thanks-Round] (Div. 2)
#include<stdio.h> #include<string.h> #include<iostream> #define rep(i,a,b) for(int i = a ; i < b ; i++) #define rrep(i,a,b) for(int i = b-1 ; i >= a ; i--) using namespace std; int main() { int a[100005] , b[100005] , n ,m , s ,d; cin >> n >> m >> s >> d; rep(i,0,n) cin >> a[i]; rrep(i,0,m) cin >> b[i]; if(a[s-1] < b[d-1]) cout << "YES"<< endl; else cout << "NO" <<endl; }
相關推薦
Codeforces Round #317 [AimFund Thanks-Round] (Div. 2)
#include<stdio.h> #include<string.h> #include<iostream> #define rep(i,a,b) for(int i = a ; i < b ; i++) #define rrep(i,a,b) for(i
Round #423 C. String Reconstruction(Div.2)
sum turn include truct urn tput aaa eas tin Ivan had string s consisting of small English letters. However, his friend Julia decide
Round #423 B. Black Square(Div.2)
equal ive tle ima color ont carp char let Polycarp has a checkered sheet of paper of size n?×?m. Polycarp painted some of cells with bla
CodeForces E. XOR and Favorite Number(Div.2)
題解 一個莫隊的基礎題,題目要求[L,R]裡面有多少對子區間異或值為k,記錄一下字首異或和arr,因為xx=0,現在我們要求區間[L,R]的異或和值,用arr陣列表示就是arr[L-1]arr[R]=k,或者說arr[R]^k=arr[L-1] import
【Codeforces】Codeforces Round #492 (Div. 2) [Thanks, uDebug!] (Contest 996)
spl === bsp -- href 分享 printf cli 位置 題目 傳送門:QWQ A:A - Hit the Lottery 分析: 大水題 模擬 代碼: #include <bits/stdc++.h&g
Codeforces Round #518 (Div. 2) [Thanks, Mail.Ru!]
B. LCM Ivan has number bb. He is sorting through the numbers aa&nb
Codeforces Round #221 (Div. 2) D
cpp 位置 input memset ont code init cal 矩形 有點郁悶的題目,給了2000ms,可是n,m的範圍已經是5000了。5000 * 5000一般在別的OJ已經是超了2000ms,一開始不敢敲。看了下別人有n*m的潛逃循環,原來CF的機子如
Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3) B. T-Shirt Hunt
seconds ack ble pseudo lose tinc += repeat ac代碼 B. T-Shirt Hunt time limit per test2 seconds memory limit per test256 megabytes inputsta
Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3) E. Prairie Partition 二分+貪心
必須 could col clas == show with str ati E. Prairie Partition It can be shown that any positive integer x can be uniquely re
2017-5-2-Train:Codeforces Round #323 (Div. 2)
width ins exp seq main ons mon tel exists A. Asphalting Roads(模擬) City X consists of n vertical and n horizontal infinite roads, forming
【貪心】【multiset】Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2) C. Naming Company
nal head 1+n final ase algorithm erase 集合 clu 考慮兩個人,先把各自的集合排個序,丟掉一半,因為比較劣的那一半一定用不到。 然後貪心地放,只有兩種決策,要麽把一個最優的放在開頭,要麽把一個最劣的放在結尾。 如果我的最優的比對方所有
Codeforces Round #414 Div.2
span main pre style namespace one ret == hide A 膜你 1 #include<cstdio> 2 #include<iostream> 3 using namespace std; 4 5
Codeforces Round #365 (Div. 2) D - Mishka and Interesting sum(離線樹狀數組)
turn string 之前 algorithm printf ace r++ void contest http://codeforces.com/contest/703/problem/D 題意: 給出一行數,有m次查詢,每次查詢輸出區間內出現次數為偶數次的數字的異
Codeforces Round #271 (Div. 2) D. Flowers (遞推 預處理)
int art style eve itl which pop 有一種 esp We saw the little game Marmot made for Mole‘s lunch. Now it‘s Marmot‘s dinner time and, as we
Codeforces Round #406 (Div. 2) E. Till I Collapse(主席樹)
esp type 個數 gif lan upd roo node .com 題目鏈接:Codeforces Round #406 (Div. 2) E. Till I Collapse 題意: 給你n個數,對於每一個k(1<=k<=n),劃分區間,每個區間只能有
Codeforces Round #Pi (Div. 2) (STL專場)
type ef7 ogre space each redo 長度 lang max Codeforces Round #Pi (Div. 2) A - Lineland Mail 水題,拼手速。 /* * @author Novicer * language :
Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)B. T-shirt buying
character break empty not integer contain strong accept space 傳送門 Description A new pack of n t-shirts came to a shop. Each of the t-
Codeforces Round #416 (Div. 2) A+B
src separate not sum redo swe tput output depend A. Vladik and Courtesy 2 seconds 256 megabytes At regular competition Vl
Codeforces Round #415 (Div. 2) C. Do you want a date?
for 題目 point system pro only const man test C. Do you want a date? 2 seconds 256 megabytes Leha decided to move to a
【動態規劃】 Codeforces Round #416 (Div. 2) C. Vladik and Memorable Trip
and main spa def esp 動態 return 價值 can 劃分那個序列,沒必要完全覆蓋原序列。對於劃分出來的每個序列,對於某個值v,要麽全都在該序列,要麽全都不在該序列。 一個序列的價值是所有不同的值的異或和。整個的價值是所有劃分出來的序列的價值之和。