By registering with us, you'll be able to discuss, share and private message with other members of our community.

SignUp Now!
  • Guest, before posting your code please take these rules into consideration:
    • It is required to use our BBCode feature to display your code. While within the editor click < / > or >_ and place your code within the BB Code prompt. This helps others with finding a solution by making it easier to read and easier to copy.
    • You can also use markdown to share your code. When using markdown your code will be automatically converted to BBCode. For help with markdown check out the markdown guide.
    • Don't share a wall of code. All we want is the problem area, the code related to your issue.

    To learn more about how to use our BBCode feature, please click here.

    Thank you, Code Forum.


New Coder
Hi! Can someone translate this code from c++ to php?

#include <cstdio>
#include <algorithm>

#define REP(a,n) for (int a=0; a<(n); ++a)

using namespace std;

#define INF 1000000000

typedef long long LL;


#define MAXN 1000000

int wagi[MAXN];
int orig[MAXN]; 
int perm[MAXN]; 
bool vis[MAXN]; 

int minw = INF;

int main()
    int N;
    scanf("%d", &N);
    REP(a, N)
        scanf("%d", &wagi[a]);
        minw = min(minw, wagi[a]);
    REP(a, N)
        scanf("%d", &orig[a]);
    REP(a, N)
        int nr;
        scanf("%d", &nr);
        perm[nr] = orig[a];
    LL wynik = 0;
    REP(pocz, N)
        if (!vis[pocz])
            int minc = INF; 
            LL suma = 0; 
            int cur = pocz;
            int dl = 0; 
            for (;;)
                minc = min(minc, wagi[cur]);
                suma += wagi[cur];
                cur = perm[cur];
                vis[cur] = true;
                if (cur==pocz)
            wynik += min(suma+(dl-2)*(LL)minc, suma+minc+(dl+1)*(LL)minw);
    printf("%Ld\n", wynik);

New Threads

Latest posts

Buy us a coffee!

Top Bottom