JX NOIP2021 迷惑行为大赏

CSP_Sept · 2021-11-20 18:02:27 · 个人记录

如果您不希望自己的代码出现在这里，请私信 CSP_Sept。

\Large\textbf0\textsf{ 前言}

依旧闲的没事干（

感谢小波提供的脚本。
感谢 WYX 提供参考。
以及我自己以前的作品：JX CSP-S2021 迷惑行为大赏 （

正片开始。

\Large\textbf1\textsf{ 总括}

JX 省的 OIer 们一共写了 706 个 \texttt{freopen}，739 个 \texttt{include}，233 个万能头，5727 个 \texttt{int}，240 个 \texttt{long long}。

其中 \texttt{freopen} 被注释掉的共有 7 个。

受疫情影响，有 $22$ 人未能参赛，默哀。 $\Large\textbf2\textsf{ 奇人共赏}

===== Successfully open the file answers\JX-0078\sequence\sequence.cpp.The size of it is 7.621 KB.
... ...
inline void task1() {
    unsigned long long val = 0;
    for (a[1] = 0; a[1] <= m; ++a[1]) {
        for (a[2] = a[1]; a[2] <= m; ++a[2]) {
            for (a[3] = a[2]; a[3] <= m; ++a[3]) {
                for (a[4] = a[3]; a[4] <= m; ++a[4]) {
                    for (a[5] = a[4]; a[5] <= m; ++a[5]) {
                        for (a[6] = a[5]; a[6] <= m; ++a[6]) {
                            for (a[7] = a[6]; a[7] <= m; ++a[7]) {
                                for (a[8] = a[7]; a[8] <= m; ++a[8]) {
                                    int S = 0;
                                    for (register int i = 1; i <= n; ++i) {
                                        S += poww[a[i]];
                                    }
                                    ... ...
... ...

⑨ 层循环人

JX 共有 3 个 OIer 挑战知识版权，这里就不再鞭尸了。

===== Successfully open the file   answers\JX-0123\number\number.cpp.The size of it is 0.814 KB.
//520CCF
//Tuling baoyou
... ...

图灵保佑 & 表白人

此外的 T3 T4，他也写了这两句，疑似是老嘉宾，详见上篇文章。

1122.456 KB 人

===== The file   answers\JX-0076\number\number.cpp is too big!The size of it is 1122.456 KB.
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int b7[N]={
7,
14,17,21,27,28,34,35,37,42,47,
49,51,54,56,57,63,67,68,70,71,
72,73,74,75,76,77,78,79,81,84,
85,87,91,94,97,98,102,105,107,108,
111,112,114,117,119,126,127,133,134,135,
136,137,140,141,142,144,146,147,148,150,
152,153,154,156,157,158,161,162,167,168,
170,171,172,173,174,175,176,177,178,179,
182,185,187,188,189,194,196,197,201,203,
204,207,210,213,214,216,217,219,221,222,
224,225,227,228,231,234,235,237,238,243,
245,247,252,254,255,257,259,261,266,267,
268,270,271,272,273,274,275,276,277,278,
279,280,282,284,285,287,288,289,291,292,
294,296,297,300,301,304,306,307,308,312,
314,315,316,317,321,322,323,324,327,329,
333,334,335,336,337,340,342,343,344,346,
347,348,350,351,352,354,355,356,357,358,
360,364,365,367,370,371,372,373,374,375,
376,377,378,379,380,381,385,387,388,390,
391,392,394,395,397,399,402,405,406,407,
408,411,413,414,417,420,423,425,426,427,
428,432,434,435,437,438,441,442,444,447,
... ...

小窗长这样：

注意到这幅图只截取了他全部表的 \textbf{1.22\%}。

众所周知，T2 应该拆开式子，否则会精度误差。

而 JX 的 OIer 们写了 152 个 \texttt{double}。

===== Successfully open the file     answers\JX-0009\chess\chess.cpp.The size of it is 4.551 KB.
#include<bits/stdc++.h>
using namespace std;

//tiaoshi 

... ...

/*
__gnu_pbds::gp_hash_table<pair<pair<int , int> , pair<int , int> > , int> w;
__gnu_pbds::gp_hash_table<pair<int , int> , pair<int , int>> s;
__gnu_pbds::gp_hash_table<pair<int , int> , bool> book;
*/

std::map<pair<pair<int , int> , pair<int , int> > , int> w;
std::map<pair<int , int> , pair<int , int> > s;
std::map<pair<int , int> , bool> book;
int dx[4] = {1 , 0 , -1 , 0} , dy[4] = {0 , 1 , 0 , -1};
std::queue<pair<int , int> > q;

走在 STL 顶端的人

===== Successfully open the file     answers\JX-0110\variance\variance.cpp.
//This problem, I also wrong answer, but I think I can get 0~10 point from this problem
//I wrote Luogu Problem Variance last day, but I can't Accepted, too. I forget how to write.
//Oh, I'm a lj. I can't got 1= 2=. I'll Away From OI, Goodbye OI~

===== Successfully open the file     answers\JX-0110\chess\chess.cpp.
//Wrong program, too. I can't get point from this problem
//I sees Luogu Problem Duck Chess and play it last week.
//But I can't Accepted, too. I don't see how to write it.
//I can't got 1= 2=. I'll Away From OI, Goodbye OI~

好家伙还是连续剧（

祝好。

一共有 5 处 \texttt{AFO}。

某位 OIer（保护隐私，准考证号已隐去）写了 chess 的 6.9 KB，这里截取一个函数：

void bfs(int col, int lv, int x, int y) {
    if (x > 1 && line2[xy_to_pos(x - 1, y)] == 3 && (!vis[xy_to_pos(x - 1, y)])) {
        vis[xy_to_pos(x - 1, y)] = true;
        if (board[xy_to_pos(x - 1, y)].second) {
            if (attack(col, lv, xy_to_pos(x - 1, y))) bfs_add(x - 1, y);
        } else bfs_add(x - 1, y), bfs(col, lv, x - 1, y);
    }
    if (x < n && line2[xy_to_pos(x, y)] == 3 && (!vis[xy_to_pos(x + 1, y)])) {
        vis[xy_to_pos(x + 1, y)] = true;
        if (board[xy_to_pos(x + 1, y)].second) {
            if (attack(col, lv, xy_to_pos(x + 1, y))) bfs_add(x + 1, y);
        } else bfs_add(x + 1, y), bfs(col, lv, x + 1, y);
    }
    if (y > 1 && line1[xy_to_pos(x, y - 1)] == 3 && (!vis[xy_to_pos(x, y - 1)])) {
        vis[xy_to_pos(x, y - 1)] = true;
        if (board[xy_to_pos(x, y - 1)].second) {
            if (attack(col, lv, xy_to_pos(x, y - 1))) bfs_add(x, y - 1);
        } else bfs_add(x, y - 1), bfs(col, lv, x, y - 1);
    }
    if (y < n && line1[xy_to_pos(x, y)] == 3 && (!vis[xy_to_pos(x, y + 1)])) {
        vis[xy_to_pos(x, y + 1)] = true;
        if (board[xy_to_pos(x, y + 1)].second) {
            if (attack(col, lv, xy_to_pos(x, y + 1))) bfs_add(x, y + 1);
        } else bfs_add(x, y + 1), bfs(col, lv, x, y + 1);
    }
}

/bx

先写这些罢。