11.9 CSP reflection before training camp

CSP reflection before training camp

Today is the one-day game;

Morning, for some reason unable to attend the so-called? ? ? Confidence game? ? ? I only played about about 1h30min at home

T1: water problems, Dp look, pay attention to sentence boundary. Gone

T2: half the answer? ? I totally did not answer to the direction of bipartite think QAQ. The median of these topics do less, fully exposed their deficiencies QAQ

but;;;;;;;;;;

No positive solution can actually get a full 80pts  ? ? ? ?

Here under the said sub-card cheat practice. . First, this question median certain sections will be repeated several times to discuss, the value after the current multiple searches conducted globally is likely to be the optimal value, with the increase in number of operations, to the global search the greater the probability of optimal value, so long as the end of the program will go out on it 1s

The title card when not only 30pts, after using a maximum of 80pts (mainly to see the face) put here wandy julao excellent program run time statistics

 

// 
#include<bits/stdc++.h> 
using namespace std; 
main(){ 
    int st=clock(); 
    for(int i=1;i<=1e9;i++) 
    { 
        if(clock()-st>=700)break; 
    } 
}

 Here's the way to put about half of the template unique

int l = 0, r = int(1e9), tmp;
    for(int mid;l <= r;)
    {
        mid = l + r >> 1;
        if (test(mid)) tmp = mid, l = mid + 1; else r = mid - 1;
    }
    printf("%d\n", tmp);

 

T3: Well. . . . I was only 20min, and thought n ^ 2 60pts violence do not have time to play the QAQ. . . . . .