# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
830724 | 2023-08-19T09:50:18 Z | vjudge1 | Lightning Rod (NOI18_lightningrod) | C++17 | 2000 ms | 165476 KB |
#include<bits/stdc++.h> #define ll long long #define fi first #define se second using namespace std; const int nmax = 1e7+7; struct point { int x; int y; int dex; }; bool cmp(point &a, point&b) { return (a.y > b.y); } int par[nmax]; bool soada[nmax] = {false}; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int N; cin >> N; vector<point>tik(N+1); bool sub1=true; int hit=0; for(int i=1; i<=N; i++) par[i]=i; for(int i=0; i<N; i++) { cin >> tik[i].x >> tik[i].y; if(i>1 && tik[i].x!=tik[i-1].x) hit++; if(tik[i].y!=1) sub1=false; } if(sub1) { cout << hit+1 << endl; return 0; } sort(tik.begin(), tik.end(), cmp); for(int i=0; i<N; i++) { tik[i].dex = i+1; } vector<int>dafter; while(!tik.empty()) { dafter.push_back(0); for(int i=1; i<tik.size(); i++) { if(abs(tik[0].x - tik[i].x) <= tik[0].y-tik[i].y) { par[tik[i].dex] = tik[0].dex; //cout << "par[" << tik[i].dex << "] = " << tik[0].dex << endl; dafter.push_back(i); } } int kur = 0; for(int j=0; j<dafter.size(); j++) { //cout << "dafter " << dafter[j] << endl; tik.erase(tik.begin()+dafter[j]-kur); kur++; } dafter.clear(); } int cost = 0; for(int i=1; i<=N; i++) { if(soada[par[i]]==false) { cost++; soada[par[i]]=true; } } cout << cost << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1157 ms | 163160 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Incorrect | 1 ms | 212 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Incorrect | 1 ms | 212 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Incorrect | 1 ms | 212 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Incorrect | 1 ms | 212 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2084 ms | 165476 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1157 ms | 163160 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |