oj.uz

답안 #1119805

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1119805 2024-11-27T12:41:39 Z modwwe 버스 (JOI14_bus) C++17
100 / 100
 244 ms 28648 KB 
#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

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);
      |         ^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5200 KB Output is correct
2 Correct 5 ms 5200 KB Output is correct
3 Correct 6 ms 4976 KB Output is correct
4 Correct 6 ms 5200 KB Output is correct
5 Correct 7 ms 5200 KB Output is correct
6 Correct 5 ms 5200 KB Output is correct
7 Correct 5 ms 4944 KB Output is correct
8 Correct 5 ms 5168 KB Output is correct
9 Correct 4 ms 5200 KB Output is correct
10 Correct 5 ms 5068 KB Output is correct
11 Correct 6 ms 5272 KB Output is correct
12 Correct 7 ms 5400 KB Output is correct
13 Correct 8 ms 5356 KB Output is correct
14 Correct 5 ms 5180 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4944 KB Output is correct
2 Correct 31 ms 8088 KB Output is correct
3 Correct 30 ms 7884 KB Output is correct
4 Correct 8 ms 5428 KB Output is correct
5 Correct 7 ms 5456 KB Output is correct
6 Correct 7 ms 5456 KB Output is correct
7 Correct 25 ms 6908 KB Output is correct
8 Correct 6 ms 4944 KB Output is correct
9 Correct 22 ms 7108 KB Output is correct
10 Correct 26 ms 8200 KB Output is correct
11 Correct 24 ms 7268 KB Output is correct
12 Correct 26 ms 8260 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 196 ms 23464 KB Output is correct
2 Correct 172 ms 23684 KB Output is correct
3 Correct 192 ms 23592 KB Output is correct
4 Correct 187 ms 23452 KB Output is correct
5 Correct 180 ms 23712 KB Output is correct
6 Correct 168 ms 23456 KB Output is correct
7 Correct 149 ms 21060 KB Output is correct
8 Correct 183 ms 23476 KB Output is correct
9 Correct 200 ms 23676 KB Output is correct
10 Correct 143 ms 20720 KB Output is correct
11 Correct 127 ms 20680 KB Output is correct
12 Correct 140 ms 20548 KB Output is correct
13 Correct 132 ms 20620 KB Output is correct
14 Correct 149 ms 20548 KB Output is correct
15 Correct 148 ms 20500 KB Output is correct
16 Correct 57 ms 15540 KB Output is correct
17 Correct 55 ms 15544 KB Output is correct

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 27084 KB Output is correct
2 Correct 204 ms 27548 KB Output is correct
3 Correct 218 ms 28648 KB Output is correct
4 Correct 244 ms 27404 KB Output is correct
5 Correct 242 ms 24340 KB Output is correct
6 Correct 224 ms 24536 KB Output is correct
7 Correct 170 ms 20688 KB Output is correct
8 Correct 241 ms 24732 KB Output is correct
9 Correct 196 ms 24732 KB Output is correct
10 Correct 172 ms 20352 KB Output is correct
11 Correct 154 ms 20476 KB Output is correct
12 Correct 180 ms 20464 KB Output is correct
13 Correct 172 ms 20328 KB Output is correct
14 Correct 160 ms 22416 KB Output is correct
15 Correct 153 ms 20476 KB Output is correct
16 Correct 85 ms 17476 KB Output is correct