oj.uz

답안 #1114354

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114354 2024-11-18T16:16:08 Z modwwe Drivers (BOI24_drivers) C++17
100 / 100
 116 ms 25416 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".ans","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 = 1e16;
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;

};
ll 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,p ;
int kk;
int el = 19;
main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo();
    // checktime
}
struct dsu
{
    ib ds[200001];
    void reset()
    {
        for(int i=1; i<=n; i++)
            ds[i]= {1,i};
    }
    int get(int x)
    {
        if(ds[x].b!=x) return ds[x].b=get(ds[x].b);
        return x;
    }
    void noi(int x,int y)
    {
        x=get(x);
        y=get(y);
        if(x==y) return;
        if(ds[x].a<ds[y].a) swap(x,y);
        ds[x].a+=ds[y].a;
        ds[y].b=x;
    }
} ds;
id a[200001];
id ask[200001];
int cc[200001];
bool cmp(id a,id b)
{
    return a.c<b.c;
}
void phongbeo()
{
    cin>>n>>m>>k;
    for(int i=1; i<=m; i++)
        cin>>a[i].a>>a[i].b>>a[i].c;
    sort(a+1,a+1+m,cmp);
    for(int i=1; i<=k; i++)
        cin>>ask[i].a>>ask[i].b>>ask[i].c,ask[i].d=i;
    sort(ask+1,ask+1+k,cmp);
    ds.reset();
    l=1;
    for(int i=1; i<=k; i++)
    {
        while(l<=m&&a[l].c<=ask[i].c)
        {
            ds.noi(a[l].a,a[l].b);
            l++;
        }
        if(ds.get(ask[i].a)==ds.get(ask[i].b))
            cc[ask[i].d]=1;
        else cc[ask[i].d]=0;
    }

    for(int i=1; i<=k; i++)
    {
        if(!cc[i])cout<<"NE";
        else cout<<"TAIP";
        down
    }
}

Compilation message

Main.cpp:75:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   75 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.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)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:79:9: note: in expansion of macro 'fin'
   79 |         fin(task);
      |         ^~~
Main.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".ans","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:80:9: note: in expansion of macro 'fou'
   80 |         fou(task);
      |         ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 6480 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 61 ms 14144 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6480 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 2 ms 6480 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 2 ms 6480 KB Output is correct
6 Correct 2 ms 6624 KB Output is correct
7 Correct 3 ms 6480 KB Output is correct
8 Correct 2 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 2 ms 6652 KB Output is correct
11 Correct 3 ms 6480 KB Output is correct
12 Correct 3 ms 6736 KB Output is correct
13 Correct 2 ms 6664 KB Output is correct
14 Correct 3 ms 6736 KB Output is correct
15 Correct 2 ms 6736 KB Output is correct
16 Correct 1 ms 6480 KB Output is correct
17 Correct 1 ms 6480 KB Output is correct
18 Correct 2 ms 6480 KB Output is correct
19 Correct 5 ms 6992 KB Output is correct
20 Correct 1 ms 6480 KB Output is correct
21 Correct 2 ms 6480 KB Output is correct
22 Correct 2 ms 6648 KB Output is correct
23 Correct 2 ms 6480 KB Output is correct
24 Correct 5 ms 6852 KB Output is correct
25 Correct 2 ms 6480 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 6480 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 61 ms 14144 KB Output is correct
6 Correct 2 ms 6480 KB Output is correct
7 Correct 3 ms 6480 KB Output is correct
8 Correct 3 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 3 ms 6480 KB Output is correct
11 Correct 3 ms 6716 KB Output is correct
12 Correct 1 ms 6480 KB Output is correct
13 Correct 2 ms 6480 KB Output is correct
14 Correct 2 ms 6480 KB Output is correct
15 Correct 2 ms 6480 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 6480 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 61 ms 14144 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 2 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 2 ms 6480 KB Output is correct
11 Correct 2 ms 6624 KB Output is correct
12 Correct 3 ms 6480 KB Output is correct
13 Correct 2 ms 6480 KB Output is correct
14 Correct 2 ms 6480 KB Output is correct
15 Correct 2 ms 6652 KB Output is correct
16 Correct 3 ms 6480 KB Output is correct
17 Correct 3 ms 6736 KB Output is correct
18 Correct 2 ms 6664 KB Output is correct
19 Correct 3 ms 6736 KB Output is correct
20 Correct 2 ms 6736 KB Output is correct
21 Correct 1 ms 6480 KB Output is correct
22 Correct 1 ms 6480 KB Output is correct
23 Correct 2 ms 6480 KB Output is correct
24 Correct 5 ms 6992 KB Output is correct
25 Correct 1 ms 6480 KB Output is correct
26 Correct 2 ms 6480 KB Output is correct
27 Correct 2 ms 6648 KB Output is correct
28 Correct 2 ms 6480 KB Output is correct
29 Correct 5 ms 6852 KB Output is correct
30 Correct 2 ms 6480 KB Output is correct
31 Correct 2 ms 6480 KB Output is correct
32 Correct 3 ms 6480 KB Output is correct
33 Correct 3 ms 6480 KB Output is correct
34 Correct 2 ms 6480 KB Output is correct
35 Correct 3 ms 6480 KB Output is correct
36 Correct 3 ms 6716 KB Output is correct
37 Correct 1 ms 6480 KB Output is correct
38 Correct 2 ms 6480 KB Output is correct
39 Correct 2 ms 6480 KB Output is correct
40 Correct 2 ms 6480 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 6480 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 61 ms 14144 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 2 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 2 ms 6480 KB Output is correct
11 Correct 2 ms 6624 KB Output is correct
12 Correct 3 ms 6480 KB Output is correct
13 Correct 2 ms 6480 KB Output is correct
14 Correct 2 ms 6480 KB Output is correct
15 Correct 2 ms 6652 KB Output is correct
16 Correct 3 ms 6480 KB Output is correct
17 Correct 3 ms 6736 KB Output is correct
18 Correct 2 ms 6664 KB Output is correct
19 Correct 3 ms 6736 KB Output is correct
20 Correct 2 ms 6736 KB Output is correct
21 Correct 1 ms 6480 KB Output is correct
22 Correct 1 ms 6480 KB Output is correct
23 Correct 2 ms 6480 KB Output is correct
24 Correct 5 ms 6992 KB Output is correct
25 Correct 1 ms 6480 KB Output is correct
26 Correct 2 ms 6480 KB Output is correct
27 Correct 2 ms 6648 KB Output is correct
28 Correct 2 ms 6480 KB Output is correct
29 Correct 5 ms 6852 KB Output is correct
30 Correct 2 ms 6480 KB Output is correct
31 Correct 2 ms 6480 KB Output is correct
32 Correct 3 ms 6480 KB Output is correct
33 Correct 3 ms 6480 KB Output is correct
34 Correct 2 ms 6480 KB Output is correct
35 Correct 3 ms 6480 KB Output is correct
36 Correct 3 ms 6716 KB Output is correct
37 Correct 1 ms 6480 KB Output is correct
38 Correct 2 ms 6480 KB Output is correct
39 Correct 2 ms 6480 KB Output is correct
40 Correct 2 ms 6480 KB Output is correct
41 Correct 116 ms 25416 KB Output is correct
42 Correct 8 ms 9040 KB Output is correct
43 Correct 8 ms 9040 KB Output is correct
44 Correct 12 ms 9284 KB Output is correct
45 Correct 11 ms 9284 KB Output is correct
46 Correct 8 ms 6992 KB Output is correct
47 Correct 83 ms 23368 KB Output is correct
48 Correct 10 ms 9296 KB Output is correct
49 Correct 89 ms 25024 KB Output is correct