关于memset

Melo.VVちゃん @ 2024-03-26 21:22:01

by smile_jyc @ 2024-03-26 21:22:58

@shin_chan_jiang memset把我整崩溃了，不如用for清空

by Vitamin_B @ 2024-03-26 21:27:48

@shin_chan_jiang 哪题？

by Vitamin_B @ 2024-03-26 21:28:06

@smile_jyc for清空不如fill

by Melo.VVちゃん @ 2024-03-26 21:28:43

@Special_Tony p1364

by Guo1 @ 2024-03-26 21:29:00

e,memset本身就是一个高风险操作

by Vitamin_B @ 2024-03-26 21:29:46

@shin_chan_jiang 你die码呢

by Vitamin_B @ 2024-03-26 21:30:04

@Guo1 ?

by Melo.VVちゃん @ 2024-03-26 21:31:37

#include <bits/stdc++.h>
#define rep(i ,m ,n ,x) for (int i = (m) ;i <= (n) ;i += (x))
#define IOS ios :: sync_with_stdio(0) ;cin.tie (0) ;cout.tie (0)
using namespace std ;
const int N = 1e2 + 7 ;
int n ,kafka[N][N] ,w[N] ,sum ,minn = 0x3f3f3f3f ;
int main () {
    IOS ;
    memset (kafka ,0x3f ,sizeof (kafka)) ;
    cin >> n ;
    rep (i ,1 ,n ,1) {
        int u ,v ;
        cin >> w[i] >> u >> v ;
        kafka[i][i] = 0 ;
        if (u) {
            kafka[u][i] = kafka[i][u] = 1 ;     
        }
        if (v) {
            kafka[v][i] = kafka[i][v] = 1 ;
        }
    }
    rep (k ,1 ,n ,1) {
        rep (i ,1 ,n ,1) {
            if (i != k) {
                rep (j ,1 ,n ,1) {
                    if (i != j and k != j and kafka[i][j] > kafka[i][k] + kafka[k][j]) {
                        kafka[i][j] = kafka[i][k] + kafka[k][j] ;
                    }
                }
            }
        }
    }
    rep (i ,1 ,n ,1) {
        sum = 0 ;
        rep (j ,1 ,n ,1) {
            sum += kafka[i][j] * w[j] ;
        }
        minn = min (minn ,sum) ;
    }
    cout << minn << endl ;
    return 0 ;
}

@Special_Tony

换成127就只有20分

by zjh114514 @ 2024-03-26 21:35:56

@shin_chan_jiang 0x3f也不是127啊

by Melo.VVちゃん @ 2024-03-26 21:44:39

@zjh114514 但都是无穷大啊