| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|
| 1119805 |  | modwwe | 버스 (JOI14_bus) | C++17 |  | 244 ms | 28648 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.
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
//#define int  long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
}
void phongbeo();
const int inf = 1e9;
const ll mod2 = 1e9 + 7;
const int  mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0)x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;
};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,t,lim,w,l,r ;
int kk;
int el = 19;
main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
   // modwwe
    phongbeo();
    // checktime
}
bool cmp(id a,id b)
{
    return a.c>b.c;
}
bool cmp2(ib a,ib b)
{
     return a.a>b.a;
}
vector<id> v;
vector<int> dp[100001];
vector<int> c[100001];
int pos[100001];
int ans[100001];
vector<ib> ask;
void phongbeo()
{
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        cin>>l>>r>>s2>>s3;
        c[l].pb(s2);
        v.pb({l,r,s2,s3});
    }
    for(int i=1; i<=n; i++)
    {
        sort(c[i].begin(),c[i].end());
        dp[i].resize(c[i].size()+1);
        pos[i]=c[i].size();
                dp[i][c[i].size()]=inf;
    }
    sort(v.begin(),v.end(),cmp);
    for(auto x:v)
    {
        pos[x.a]--;
        if(x.b==n)
        {
            dp[x.a][pos[x.a]]=min(dp[x.a][pos[x.a]+1],x.d);
            continue;
        }
        int timeb=(lower_bound(c[x.b].begin(),c[x.b].end(),x.d)-c[x.b].begin());
        dp[x.a][pos[x.a]]=min(dp[x.a][pos[x.a]+1],dp[x.b][timeb]);
    }
 cin>>m;
  for(int i=1;i<=m;i++)
  {
       cin>>r;
        ask.pb({r,i});
  }
  sort(ask.begin(),ask.end(),cmp2);
   l=c[1].size()-1;
  for(auto x:ask)
  {
     while(l>=0&&dp[1][l]>x.a)
     {
         l--;
     }
     if(l==-1)
        ans[x.b]=-1;
     else ans[x.b]=c[1][l];
  }
   for(int i=1;i<=m;i++)
     cout<<ans[i],down
}
Compilation message (stderr)
bus.cpp:75:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   75 | main()
      | ^~~~
bus.cpp: In function 'int main()':
bus.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
bus.cpp:79:9: note: in expansion of macro 'fin'
   79 |         fin(task);
      |         ^~~
bus.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
bus.cpp:80:9: note: in expansion of macro 'fou'
   80 |         fou(task);
      |         ^~~| # | 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... |