# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102410 | Darksinian | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 496 ms | 82720 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define f first
#define s second
#define ll long long
using namespace std;
const int N = 100002;
int vv[N];
set<pair<int,int> > vis;
ll d[N];
pair<int,int> p[N];
vector<pair<int,int> > g[N];
map<int,int> po[N];
int main()
{
int n,m;
cin >> n >> m;
for(int i =0;i<m;i++) {
int a,b;
cin >> a >> b;
p[i] = {a,b};
po[a][b] = i;
}
for(int i =0;i<m;i++) {
int pre=-1;
int x = p[i].f,pr = p[i].s;
if(vis.count({x,pr})) continue;
for(int j = x%pr;j<n;j+=pr) {
int w = abs((j-x)/pr);
if(po[j].count(pr)) {
if(pre == -1) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |