Pagini recente » Borderou de evaluare (job #625118) | Borderou de evaluare (job #3196453) | Borderou de evaluare (job #2661045) | Borderou de evaluare (job #400040) | Borderou de evaluare (job #2929408)
Borderou de evaluare (job #2929408)
Raport evaluator
Compilare:
main.cpp: In function 'void s(int, int)':
main.cpp:2:207: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
2 | using namespace std;ifstream fin("arbore7.in");ofstream fout("arbore7.out");const int N=1e5+7,M=1e9+7;int n,x[N][2];long long p[N][2];vector<int> v[N];bool k[N];void s(int d,int t){k[d] = true;for(int i=0;i<v[d].size();i++){int u=v[d][i];if(!k[u])s(u,d);}x[d][0]=1;for(int i=0;i<v[d].size();i++){int u=v[d][i];if(u==t)continue;x[d][1]+=max(x[u][0],x[u][1]);x[d][0]+=max(x[u][0]-1,x[u][1]);}p[d][1]=1;p[d][0]=1;for(int i=0;i<v[d].size();i++){int u=v[d][i];if(u==t)continue;long long b=0;b=x[u][0]-1>x[u][1]?p[u][0]:x[u][0]-1<x[u][1]?p[u][1]:p[u][0]+p[u][1];p[d][0]=(p[d][0]*b)%M;b=0;b=x[u][0]>x[u][1]?p[u][0]:x[u][0]<x[u][1]?p[u][1]:p[u][0]+p[u][1];p[d][1]=(p[d][1]*b)%M;}}int main(){fin>>n;for(int i=1;i<n;i++){int o,y;fin>>o>>y;v[o].push_back(y);v[y].push_back(o);}s(1,0);x[1][0]>x[1][1]?fout<<x[1][0]<<" "<<p[1][0]%M:x[1][0]<x[1][1]?fout<<x[1][1]<<" "<<p[1][1]%M:fout<<x[1][0]<<" "<<(p[1][0]+p[1][1])%M;return 0;}
| ~^~~~~~~~~~~~
main.cpp:2:279: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
2 | using namespace std;ifstream fin("arbore7.in");ofstream fout("arbore7.out");const int N=1e5+7,M=1e9+7;int n,x[N][2];long long p[N][2];vector<int> v[N];bool k[N];void s(int d,int t){k[d] = true;for(int i=0;i<v[d].size();i++){int u=v[d][i];if(!k[u])s(u,d);}x[d][0]=1;for(int i=0;i<v[d].size();i++){int u=v[d][i];if(u==t)continue;x[d][1]+=max(x[u][0],x[u][1]);x[d][0]+=max(x[u][0]-1,x[u][1]);}p[d][1]=1;p[d][0]=1;for(int i=0;i<v[d].size();i++){int u=v[d][i];if(u==t)continue;long long b=0;b=x[u][0]-1>x[u][1]?p[u][0]:x[u][0]-1<x[u][1]?p[u][1]:p[u][0]+p[u][1];p[d][0]=(p[d][0]*b)%M;b=0;b=x[u][0]>x[u][1]?p[u][0]:x[u][0]<x[u][1]?p[u][1]:p[u][0]+p[u][1];p[d][1]=(p[d][1]*b)%M;}}int main(){fin>>n;for(int i=1;i<n;i++){int o,y;fin>>o>>y;v[o].push_back(y);v[y].push_back(o);}s(1,0);x[1][0]>x[1][1]?fout<<x[1][0]<<" "<<p[1][0]%M:x[1][0]<x[1][1]?fout<<x[1][1]<<" "<<p[1][1]%M:fout<<x[1][0]<<" "<<(p[1][0]+p[1][1])%M;return 0;}
| ~^~~~~~~~~~~~
main.cpp:2:424: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
2 | using namespace std;ifstream fin("arbore7.in");ofstream fout("arbore7.out");const int N=1e5+7,M=1e9+7;int n,x[N][2];long long p[N][2];vector<int> v[N];bool k[N];void s(int d,int t){k[d] = true;for(int i=0;i<v[d].size();i++){int u=v[d][i];if(!k[u])s(u,d);}x[d][0]=1;for(int i=0;i<v[d].size();i++){int u=v[d][i];if(u==t)continue;x[d][1]+=max(x[u][0],x[u][1]);x[d][0]+=max(x[u][0]-1,x[u][1]);}p[d][1]=1;p[d][0]=1;for(int i=0;i<v[d].size();i++){int u=v[d][i];if(u==t)continue;long long b=0;b=x[u][0]-1>x[u][1]?p[u][0]:x[u][0]-1<x[u][1]?p[u][1]:p[u][0]+p[u][1];p[d][0]=(p[d][0]*b)%M;b=0;b=x[u][0]>x[u][1]?p[u][0]:x[u][0]<x[u][1]?p[u][1]:p[u][0]+p[u][1];p[d][1]=(p[d][1]*b)%M;}}int main(){fin>>n;for(int i=1;i<n;i++){int o,y;fin>>o>>y;v[o].push_back(y);v[y].push_back(o);}s(1,0);x[1][0]>x[1][1]?fout<<x[1][0]<<" "<<p[1][0]%M:x[1][0]<x[1][1]?fout<<x[1][1]<<" "<<p[1][1]%M:fout<<x[1][0]<<" "<<(p[1][0]+p[1][1])%M;return 0;}
| ~^~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 184kb | OK | 10 |
2 | 0ms | 184kb | OK | 10 |
3 | 0ms | 184kb | OK | 10 |
4 | 0ms | 184kb | OK | 10 |
5 | 0ms | 184kb | OK | 10 |
6 | 78ms | 11313kb | OK | 10 |
7 | 75ms | 9302kb | OK | 10 |
8 | 85ms | 11755kb | OK | 10 |
9 | 85ms | 11644kb | OK | 10 |
10 | 69ms | 8396kb | OK | 10 |
Punctaj total | 100 |