erdencimi的博客

#include<iostream>#include<vector>#include<algorithm>using namespace std;int main() { std::ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n, x, y; cin >> n >> x >> y; vector<pair&l.

#include<iostream>using namespace std;int main() { std::ios::sync_with_stdio(false); int n, N; cin >> n >> N; int sum = 0, preNum = 0; for (int i = 1; i <= n; ++i) { int num; cin >> num; sum += (num - preNum) * ...

#include<iostream>#include<vector>#include<set>#include<unordered_map>#include<algorithm>using namespace std;const int MAX = 100005;unordered_map<int, pair<int, int>> arr;set<int> scores;int ans;.

#include<iostream>using namespace std;int main() { std::ios::sync_with_stdio(false); int n, k, t, xl, xr, yd, yu; cin >> n >> k >> t >> xl >> yd >> xr >> yu; int passBy = 0, stay = 0; while (n--) {.

原题链接#include<iostream>#include<map>using namespace std;map<pair<int, int>, int> points;int pos1[4][2] = { {-1, 0}, {1, 0}, {0, -1}, {0, 1} };int pos2[4][2] = { {-1, -1}, {-1, 1}, {1, -1}, {1, 1} };bool isRecycle(int x, i

题目链接：线性分类器#include<iostream>#include<vector>using namespace std;struct TestNode { int x; int y; char type; TestNode(char c = ' '): x(0), y(0), type(c){}};//判断某一类点是否都在线段一侧bool isSameSide(vector<TestNode> points, int coef1,