Rock Valley Column Reading:/article/0atx674s
I. Overview
Tips before watching: This year's CSP-S Anhui Province is not so "crowded" compared to other provinces, so please don't have any snacks (?) before watching.
This year's CSP-S Anhui had a total of 1013 entries, of which there were 1006 valid pass number source folders, and 7 people ended up not leaving any traces of their participation for various reasons.Let us mourn for them.
One of the most special candidates, AH-S00506, ta typed an extra space in front of the name of the source folder, and is the only one in Anhui's S group.Let us mourn him.
These folders ranged in size from 202 bytes to 9145904 bytes, with AH-S00915 not only winning the award for the smallest file, but also typing "arena" instead of "arean", and even having the file inside the folder as a . file, leading the pack of abstract candidates!
Candidates AH-S00385 and 422 placed their test data in folders resulting in very large files.Let us mourn for the above candidates
II. Abstract Behavioral Appreciation
1. 7,549 "114", 66 "114514", 8 "1919810", 3 "1145141919810" in a limited number of documents. "1145141919810"
2. Ingredients are too complex cause I do not want to say anything, here post the code to see for yourself!
/*
__ __
<__X__>
/ _ _ \
| / \_/ \ \ |
| | ^ ^ | |
\ \ \ \v__//
() ()
| | | |
Love Lolo forever!!!
The sound of the beginning resounds in the future.
Chinese wind and summer rhyme, Luo Shui Tian Yi.
If happiness had a color, it would be blue dyed by the red of doom.
The happiest girl in the world - Kodori!!!!
Only my RAILGUN can shoot it.
My gun can fight for another 100 years!!!!!
Sign a contract with me and become Monkey Shochu～!
--QB
It seems like I've seen it in my dreams...
Technoblade never dies!!!
No sister hating dome is not a sister, and a sister very much a sister is not a dome.
Paranoia Paranoia
First victimization
Two-fold change
Threefold love
Fourfold Sin
Fifth Hollow
Sixth infidelity
Seven Chronic Illnesses
Eightfold return
Ninth Reality
Triple Love
Cold Wishes
Zero Prayer
Self-attacking and self-suffering
Paranoia
Paranoia Reality
0721
onanii~
Cyberpunk Edgerunners
saa,ganmu o hajimeiyo!
*/
//By the way, all four documents of this 380 candidate have this paragraph ()
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp> // #include<ext/pb_ds/tree_policy.
#define ll long long
#define gc getchar
#define pc putchar
#define sc scanf
#define pr printf
#define foru(v,s,e) for(int v=s;v<=(e);v++)
#define ford(v,s,e) for(int v=s;v>=(e);v--)
using namespace std.
int in(){
int x=0;
char c=gc();
while(c<||'0'||c>|'9') c=gc();
while(c>='0'&&c<='9') x=x*10+c-'0',c=gc();
c=gc(); return x.
}
......
3. Lyrics Brother
//AH-S00418
/*
The wind tells me things I don't want to know
The river takes the stories I don't want to forget
I take off my wings and he becomes a white bird.
White bird, my white bird, go against the wind.
Fly over the river, wave it, and never come back.
I'll never come back. I'll never come back. I'll never come back. The wind and the water will never come back.
White bird, white bird, don't look back.
You must fly there for me.
That's where you and I are from.
Which is more beautiful, the picture you can't catch or the one you can't?
Which is farther away, the place we've been or the place we've never been?
White bird, my white bird, fly high and don't come back.
If you want to see me again, come to my dreams.
The white bird crosses the riverbank and waves, never to return.
Never come back, never come back, never come back, never come back, never come back, never come back, never come back, never come back, never come back.
White bird, white bird, don't look back
You have to fly to that place for me.
That's where you and I are from.
Don't come back. I'll end up in the sea.
I'm going to the sea. The sea doesn't ask where I come from.
The wind is blowing between the mountains and the sea. The white bird, the white bird, spreads its wings and enters the sky.
The sky is far beyond the sea.
"The sky is farther than the sea.
*/♪ Include
#include<bits/stdc++.h>
using namespace std.
typedef long long ll;
const int N=100005;
int tc,sub,n,m,K,nowk,A[N],O[4],a[N],le[N<<2],ri[N<<2],ban[N<<2],lfp[N]; ll cur,ans[N],outval; vector<int>c[21 ]; struct Qry{{N
struct Qry{
int k,id.
bool operator < (const Qry &a) const { return k<; }
}q[N].
......
//AH-S00526
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,f[N],x,al,no.
int main(){
freopen("", "r",stdin);
freopen("", "w",stdout); int main(){ freopen("", "w",stdin); int
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&x); f[x]++;
}
for(int i=1;i<=100000;i++){
no=min(no+f[i],al);
al+=f[i];
}
cout<<al-no.
no=min(no+f[i],al); al+=f[i]; }
}
/*
Cicada rain becomes ink in the twilight.
It seeps through, outlining tracks and ruts.
Laughter saturated with floating vapor.
The window blurs with the city.
Strumming an old guitar, humming a song in four beats.
In the echo, one seems to be at ease.
Waiting for the cool rain to neutralize the restlessness.
Searching for the wind's twists and turns.
I'm still in an uninvited, rainy, moldy place.
I'm singing a song to the sound of the rain without an audience.
The crowds are still wandering aimlessly to their destinations.
I'm busy, I'm doing nothing, I'm going on.
I'm waiting for someone to knock on my heart.
Even if it was you, you only stopped for a moment and then left.
I thought maybe someone would meet me at the next intersection.
Even if it's just a miracle.
The summer night sky appears in a distant memory.
The blooming of bright flowers and stars.
Before disappearing, I make the most tender offer.
Like the parting of those blurred figures.
Confused, bound, like fish in a city pool.
Choking or whimpering, they all dissolve into the foam.
Dragging their tired bodies to the bottom of the cold pool.
Watching the colors fade.
I'm still in a rainy, moldy place where no one cares.
I'm singing a song to the sound of the rain, without an audience.
The crowds are still wandering aimlessly to their destinations.
I'm busy, I'm doing nothing, I'm going on.
I pray for someone to knock on my heart.
Will you pay attention to me today and try to get closer?
Because maybe, at the next intersection, it will be the same.
There's no such thing as a miracle.
Night and day, parting and reunion.
Pulse and breath, searching for meaning.
I'm still in a rainy, moldy place where no one cares.
Singing songs that won't sell with the sound of the rain.
Even the floating man struggles to stay alive.
Chasing, dreaming, going on.
Please don't leave me alone in the pouring rain at the end of the world.
Singing the song of the end of the world with the sound of the rain.
At last, the search is over and the people stand still.
Crying and praying for a miracle.
With these hands, they strum the broken, rust-stained strings.
They're all lost in the rain, silent.
When the song ends, will you answer my heart?
Will you take my trembling hands in yours?
To the end of everyone's life
*/
4. A keyword search yielded 34 occurrences of "CCF", including some typical examples.
//AH-S00021
#include<bits/stdc++.h>
using namespace std;
int main()
{
freopen("", "r",stdin); freopen("", "r",stdin);
freopen("", "w",stdout);
printf("(laughed a little) People really do laugh when they're speechless\n");
printf("Can't read it, Smitty ！！！！！！！！！！！！！ \n"); printf("Can't read it.
printf("Long live the CCF, long live the CSP-J/S/NOIP/NOI ！！！！ \n");
return 0;
}
//AH-S00061，This guy's macros are allCCFI'm laughing my ass off.
//Update：2024.11.10
//And congratulations to this dude for winningAH SPrize for the longest locomotive in the group！！！
#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<iomanip>
#include<vector>
#include<queue>
#include<>
#include<map>
#include<algorithm>
#include<deque>
#include<cstdlib>
#include<bitset>
#include<stack>
#define CCF 100005
#define CCF1 1000005
#define ll long long
using namespace std;
ll t;
struct edge{
ll le,ri;
}q[CCF],q1[CCF1];
ll QAQ[CCF1];
ll cnt;
ll n,m,L,V;
ll d[CCF],v[CCF],a[CCF];
ll l[CCF],r[CCF];
ll p[CCF];
ll bj[CCF1];
ll sum[CCF1];
ll diff[CCF1];
bool cs[CCF];
bool cmp(edge x,edge y){
if(!=)
return <;
return <;
}
......
//AH-S00558
......
cout<<"CCF I LOVE(= YOU\n";
//if(fl2==0)
//{
// int cnt=0;
// sort(p+1,p+m+1);
// for(i=1;i<=m;i++)has[p[i]]=i;
// for(i=1;i<=n;i++)
// {
// if(c[i].v<=V)continue;
// double sto=c[i].d-c[i].v*c[i].v/2/c[i].a;
// sh[++cnt]={has[lower_bound(p+1,p+n+1,c[i].d)-p],has[lower_bound(p+1,p+n+1,sto)-p]};
// }
//}
}
return 0;
}
//AH-S00485
May the CCF samples be kind to me!!!!
5. I'm not going to say anything. See for yourself.
//AH-S00696
sort(p+1,p+m+1);
//cout<<teshuxingzhia()<<endl;
if(n>=3000){
//cout<<"wcnm";
int ans=0;
for(int i=1;i<=n;i++){
if(v[i]>V&&d[i]<=p[m]){
ans++;
}
}
cout<<ans<<" "<<m-1<<endl;
continue;
}
6. Failure to read
//AH-S00526
What's up with the negative sign in the //sample question? It won't read?
/*
There's still a reluctance, a struggle for silence.
Is my existence a mere performance
Is my existence just a show to make someone laugh?
*/
7. I won't.
//AH-S00681
#include<bits/stdc++.h>
using namespace std;
//I won't.！
int main(){
freopen("","r",stdin);
freopen("","w",stdout);
cout<<1;
fclose(stdin);
fclose(stdout);
return 0;//WA 0
}
8. Let me through.
//AH-S00683
......
int main(){
freopen("", "r",stdin);
//freopen("", "r",stdin);
freopen("", "w",stdout);
scanf(" %d", &n); for (int i=0;i
for (int i=0;i<n;i++){
int ri; scanf(" %d", &n)
scanf(" %d", &ri);
r[i]=ri;
}
printf("%lld", fight());
return 0; }
}
/*
orz CCF
Let me through, please.
*/
9. the guy next to me is open.
//AH-S00882
......
int main() {
freopen("","r",stdin);
freopen("","w",stdout);
int T;
scanf("%d",&T);
while(T--) {
memset(p,0,sizeof(p));
memset(d,0,sizeof(d));
memset(v,0,sizeof(v));
memset(a,0,sizeof(a));
scanf("%d%d%lf%lf",&n,&m,&L,&V);
for(int i=1;i<=n;i++) {
scanf("%lf%lf%lf",&d[i],&v[i],&a[i]);
}
for(int i=1;i<=m;i++) scanf("%lf",&p[i]);
sort(p+1,p+m+1);
solve();
}
return 0;
}
//666The guy next to me turned it on.
10. Brother Traveler
11. Commitment
//AH-S00959
/*
I actually like you for a long time, walking through the changing seasons, lighting each other's paths in life, may our relationship grow deeper and deeper. Like you. I would wish on that brightest star, wishing that our feelings can get deeper and deeper. Well, if I can hold your hand, every time the night falls, I want to say to you ...... I have imagined countless times that the starry sky is bright. So how wonderful that would be ...... Do you know?
*/
// luogu 766675 AFO
12. Empty line brother, this big brother on the examination room each document has a whole 10,000 lines, four documents add up to 40,000 lines!
//AH-S00438
#include<bits/stdc++.h>
uing namespace std;
int main(){
int n;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
cout << a[i] << n;
return 0;
}
//hereinafter omitted9988blank line
Update：2024.11.10
13. Anger spraying Tang's kid brother
//AH-S00908
......
printf("%d\n",m-ans);
}
fclose(stdin);
fclose(stdin); fclose(stdout); }
fclose(stdin); fclose(stdout); return 0; }
}
// For property A, all cars are at the same speed, and it only takes one to check if all cars are speeding.
// For property B, ai>0 always maximizes speed at the end. So the cameras that can check to see if it's speeding are from a certain position to the end. Just pick the last camera.
// For property C, ai>0 keeps the earliest camera.
// The above gives 60pts. no property is both B and C at the same time. So just make sure you choose both the beginning and the end. It's easy to know that the answer is not less than m-2.
// Oh, shit. You don't have to start at the beginning, do you? Then 2-points O(n) check for speeding. Then find the farthest camera. And then do the least-point coverage interval. This is C.
// Combine this with int ans=0;ABC, where A doesn't need to be considered separately, and B should be compatible with C (converted to interval point coverage). B should be compatible with C (converted to interval point-covering), but the detailed implementation will probably be qnlogn.
// Expected score 90pts / 100pts.
// This feels like a good place to start.
// The Down's kid brother sitting on the left keeps making strange noises. Angry.
// It's hard to express the anger I'm feeling right now in words.
// My super kid brother found the problem with the t3 questionnaire. Strong.
// 16:06 Finished the first part. Grrrrrrrrrrrrrrrrrrrrrrr. What's taking you so long?
// On luogu it's probably thinking yellow, code volume blue.
// -- This is Wen Wen Kitchen, AH-S00908, reporting for AH Traffic Radio 90.8.
// Oh my god kid brother is starting to wiggle from side to side.
// Wait a minute to consider special circumstances.
// 16:52 Finally, we're done. I'm not sure what I'm talking about. Why am I flying in the sky?
// Look at the special case. If neither B nor C are speeding, and only one A is speeding. Seems like I'd get a 0. Seems like I wouldn't. Then it's okay. Expected score is 200pts. 1h30min left.
// Yes and above or the same person
......
int main()
{
freopen("", "r",stdin);
freopen("", "w",stdout);
int T; scanf("%d,&T)
scanf("%d",&T); while(T--)solve(); int
while(T--)solve();
fclose(stdin); fclose(stdout); fclose(stdout)
fclose(stdin); fclose(stdout); fclose(stdout)
fclose(stdin); fclose(stdout); return 0;
}
// The problem is transformed into a series of numbers divided into two groups such that the sum of separate adjacent identities is maximized.
// Consider n-square dp. Hit 60pts. since there's no multitesting it seems possible to get greedy and mess around.
// 2^15 storms have 20pts. nV^3 dp has about 30-40 points.
// First guess: the same kind of number in the same group must not be bad, since ai is at least 1. But it seems harder to use directly.
// Let dp[l,r] be the maximum of the answers in the [l,r] section. Then it turns out to be a posteriori. I'm not sure how to do this.
// Can't do it and don't have enough time. Write nV^3 and go. Oh well, it seems to be false. I'll have to overhaul it.
// Now it's n^3. I'll look at t4 before I write it.
// 17:57 Finished writing n^3 for t3. I feel like I'm still typing. t1 wasted 15min. t2 was a strong debug for 2h. t3 was a perfunctory finish and took 30min. // If I don't lose points, AH 1= will be fine.
// If you don't lose points, AH 1= will be fine. But I feel like I'm still seriously too good.
// 0.5h left, don't know what to do. t4 can't read. Now please enjoy the precious image of Kid Brother taming his mouth.