# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112944 | nafis_shifat | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 54 ms | 12544 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 mx 30009
#define pii pair<int,int>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int b[m+1],p[m+1];
int sp[n+1]={};
vector<pii> edg[mx];
set<int> mp[30009];
for(int i=0;i<m;i++)
{
scanf("%d%d",&b[i],&p[i]);
sp[b[i]]=p[i];
}
for(int i=0;i<m;i++)
{
int k=0;
if(mp[b[i]].count(p[i]))continue;
for(int j=b[i]+p[i];j<n;j+=p[i])
{
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... |