The 18th Zhejiang University Programming Contest
Time:2018.6.17 8:20 - 12:20
Link solve:4/10
A
簽到
B
題意
分析
C
分析
卡內存題啊,vector會炸,vector空間是成倍增長的啊,list了解一下???
D
題意
分析
E
題意
分析
F
題意
分析
G
分析
註意 n,m<=1e5,但n×m<=3e5,故可以用一維數組代替二維數組,每次用的時候在離散化回來就行,bfs即可
二維平面上的任何一點,從其出發再回到這個點,都要走偶數步,很好證明,因為不管在x和y方向上和起點發生偏移,回到這個點相當於偏移量×2,
H
題意
分析
I
題意
分析
J
簽到
Summary
Ym:
czh:
The 18th Zhejiang University Programming Contest
相關推薦
The 18th Zhejiang University Programming Contest
test href 分析 bsp IV 方向 二維 cto tor Time:2018.6.17 8:20 - 12:20 Link solve:4/10 A 簽到 B 題意 分析 C 分析 卡內存題啊,vector會炸,vect
The 18th Zhejiang University Programming Contest 總結
刷了一下也沒有時間補題,看了別人的題解,就總結一下: A:水題 C:指標,連結串列。 F: 題意: 有個容量為c的揹包,兩類物品,其權值分別為k1、k2,第一種物品有n個,第二種有m個,每個物體都有自己的體積。當放進一個物體進入揹包時,其獲得的價值的對應的權值k乘上
The 17th Zhejiang University Programming Contest Sponsored by TuSimple(浙江省賽)
A - Marjar Cola ZOJ - 3948 簽到題,x,y,a,b,都很小直接暴力。判斷INF,只要判斷次數有沒有過多就行。 #include<iostream> #include<algorithm> #include<cstring
The North American Invitational Programming Contest 2017 題目
data reverse eric gin b+ order logs mat bottom NAIPC 2017 Yin and Yang Stones 75.39% 1000ms 262144K A mysterious cir
【The North American Invitational Programming Contest 2016 】I、Tourists
6000ms 262144K In Tree City, there are nnn tourist attractions uniquely labeled 111 to nnn. The attractions are connected by a set of n−1n - 1n
The North American Invitational Programming Contest 2016 I. Tourists(LCA)
題目連結 求樹上i,j兩點之間的距離,其中i是j的因子。 我們可以先求出LCA(i,j),然後套這個公式: dist[i,j]=(dis[i]+dis[j]−2∗dis[LCA(i,j)]+1)dist[i,j] = (dis[i]+dis[j]-2*dis[L
The North American Invitational Programming Contest 2016 I.Tourists(LCA求樹上任意兩點距離+埃式篩法)
思路來源 題意 給定一棵樹,求 dis(i,j)定義為樹上兩點距離+1,n≤2e5 題解 dfs預處理,求根節點到每一點的距離,即點i的深度depth[i]。 這裡預設1號點是根節點。 然後線上二分搜尋+倍增求LCA,求i和j的最近公共祖
F. Mountain Scenes dp The North American Invitational Programming Contest 2016
題意: 給定n個1*1的小正方形,一個w * h 的框子,任意放置,符合物理上的上下規則;問有多少种放置方法 思路: 開始想的是按層dp;事實上是不行的,複雜度很高, 然後想到了按列dp,這樣我
The North American Invitational Programming Contest 2016:E. K-Inversions(FFT)
You are given a string s consisting only of upper case letters A and B. For an integer k, a pair of indices i and j (1≤i<j≤
The 15th Zhejiang Provincial Collegiate Programming Contest(部分題解)
begin iter 一個數 ons opera cst style string += ZOJ 4024 Peak 題意 給出n和n個數,判斷該數列是否是凸形的。 解題思路 從前往後第一對逆序數,和從後往前第一隊逆序數,如果都非零而且相鄰,證明該數組是凸形的。 代碼
【貪心】LIS @The 15th Zhejiang Provincial Collegiate Programming Contest E
傳送門 題意要你構造一個序列,使得該序列的每個位置上的最長上升子序列的長度能構成給定的序列。 構造序列的元素要求還要求滿足給定的上下界 solution 我們可以把給出的最長上升子序列的長度按升序排列,長度相同的按下標降序排列。 排完序後第一個數可以
The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple
Let’s Chat Time Limit: 1 Second Memory Limit: 65536 KB ACM (ACMers’ Chatting Messenger) is a famous instant messaging software develop
ACM International Collegiate Programming Contest, Tishreen Collegiate Programming Contest (2018) Syria, Lattakia, Tishreen University, April, 30, 2018
and con account stones over ont int ble style ACM International Collegiate Programming Contest, Tishreen Collegiate Programming Contest (
The 2018 ACM-ICPC Chinese Collegiate Programming Contest Take Your Seat
scanf com 分享圖片 pro name string 技術 證明 double /* 證明過程如下 :第一種情況:按1到n的順序上飛機,1會隨意選一個,剩下的上去時若與自己序號相同的座位空就坐下去,若被占了就也會隨意選一個。求最後一個人坐在應坐位置的概率 *
Gym - 101808E Floods ACM ICPC, Damascus University Collegiate Programming Contest(2018)-E
傳送門:http://codeforces.com/gym/101808/problem/E E-Floods You probably heard and even saw the heavy rains that flooded the streets of Damascus rec
Codeforces 1090M - The Pleasant Walk - [簽到水題][2018-2019 Russia Open High School Programming Contest Problem M]
題目連結:https://codeforces.com/contest/1090/problem/M There are n houses along the road where Anya lives, each one is painted in one of k possible colors. A
The 2018 ACM-ICPC China JiangSu Provincial Programming Contest B Array (滾動陣列+規律)
JSZKC is the captain of the lala team. There are NN girls in the lala team. And their height is [1,N]and distinct. So it means there are
【ZOJ3940 The 13th Zhejiang Provincial Collegiate Programming ContestE】【腦洞 STL-MAP 複雜度分析 區間運算思想 雙指標】M
Modulo Query Time Limit: 2 Seconds Memory Limit: 65536 KB One day, Peter came across a function which looks like: F(1, X) = X mod
【離散化樹狀數組】Nordic Collegiate Programming Contest G.Galactic Collegiate Programming Contest
sizeof add urn ont col down += str one 1 #include<bits/stdc++.h> 2 using namespace std; 3 typedef long long ll; 4 int n,m; 5
German Collegiate Programming Contest 2018? A. Attack on Alpha-Zet
順序 技術分享 a-z contest 路徑 print bfs class roo 題目鏈接https://nanti.jisuanke.com/t/28852 題目大意是 h*w 的平面,每兩個點有且僅有一條路徑,類似於封閉的聯通空間,然後在這h*w個點中選取(標記