Borderou de evaluare (job #2914659)

Utilizator lolismekAlex Jerpelea lolismek Data 20 iulie 2022 16:27:49
Problema Zelda Status done
Runda Algoritmiada 2022 - Runda 4 Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: main.cpp: In function 'void DFS(modint, modint)': main.cpp:45:3: error: no match for 'operator[]' (operand types are 'modint [100001]' and 'modint') 45 | s[nod] = 1, lvl[nod] = lvl[parent] + 1, dp[nod][0] = parent; | ^ main.cpp:45:17: error: no match for 'operator[]' (operand types are 'modint [100001]' and 'modint') 45 | s[nod] = 1, lvl[nod] = lvl[parent] + 1, dp[nod][0] = parent; | ^ main.cpp:45:28: error: no match for 'operator[]' (operand types are 'modint [100001]' and 'modint') 45 | s[nod] = 1, lvl[nod] = lvl[parent] + 1, dp[nod][0] = parent; | ^ main.cpp:45:44: error: no match for 'operator[]' (operand types are 'modint [100001][18]' and 'modint') 45 | s[nod] = 1, lvl[nod] = lvl[parent] + 1, dp[nod][0] = parent; | ^ main.cpp:46:20: error: no match for 'operator[]' (operand types are 'std::vector<std::pair<long long int, long long int> > [100001]' and 'modint') 46 | for(auto vec : adj[nod]) | ^ main.cpp:48:26: error: no match for 'operator[]' (operand types are 'modint [100001]' and 'modint') 48 | DFS(vec.first, nod), s[nod] += s[vec.first], | ^ main.cpp: In function 'void LIN(modint, modint)': main.cpp:54:5: error: no match for 'operator[]' (operand types are 'std::pair<long long int, long long int> [100001]' and 'modint') 54 | lin[nod].first = ++ind; | ^ main.cpp:54:19: error: no match for 'operator++' (operand type is 'modint') 54 | lin[nod].first = ++ind; | ^~~~~ main.cpp:55:20: error: no match for 'operator[]' (operand types are 'std::vector<std::pair<long long int, long long int> > [100001]' and 'modint') 55 | for(auto vec : adj[nod]) | ^ main.cpp:58:5: error: no match for 'operator[]' (operand types are 'std::pair<long long int, long long int> [100001]' and 'modint') 58 | lin[nod].second = ++ind; | ^ main.cpp:58:20: error: no match for 'operator++' (operand type is 'modint') 58 | lin[nod].second = ++ind; | ^~~~~ main.cpp: In function 'modint lca(modint, modint)': main.cpp:62:8: error: no match for 'operator[]' (operand types are 'modint [100001]' and 'modint') 62 | if(lvl[a] < lvl[b]) | ^ main.cpp:62:17: error: no match for 'operator[]' (operand types are 'modint [100001]' and 'modint') 62 | if(lvl[a] < lvl[b]) | ^ main.cpp:65:18: error: no match for 'operator[]' (operand types are 'modint [100001]' and 'modint') 65 | modint dif = lvl[a] - lvl[b]; | ^ main.cpp:65:27: error: no match for 'operator[]' (operand types are 'modint [100001]' and 'modint') 65 | modint dif = lvl[a] - lvl[b]; | ^ main.cpp:66:21: error: conversion from 'long long int' to 'modint' is ambiguous 66 | for(modint i = LOG - 1; i >= 0; i--) Non zero exit status: 1

Ceva nu functioneaza?