Pagini recente » Borderou de evaluare (job #1635410) | Borderou de evaluare (job #2101893) | Borderou de evaluare (job #1497783) | Borderou de evaluare (job #342350) | Borderou de evaluare (job #1503640)
Borderou de evaluare (job #1503640)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:7:348: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("ctc.in","r",stdin);freopen("ctc.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}}
^
user.cpp:7:375: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("ctc.in","r",stdin);freopen("ctc.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}}
^
user.cpp: In function ‘void t(int)’:
user.cpp:7:507: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("ctc.in","r",stdin);freopen("ctc.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}}
^
user.cpp: In function ‘int main()’:
user.cpp:7:176: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("ctc.in","r",stdin);freopen("ctc.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}}
^
user.cpp:7:206: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("ctc.in","r",stdin);freopen("ctc.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}}
^
user.cpp:7:226: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("ctc.in","r",stdin);freopen("ctc.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}}
^
user.cpp:7:263: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("ctc.in","r",stdin);freopen("ctc.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 1476kb | Componente tare conexe: nod inexistent | 4 | 12 |
2 | 0ms | 1476kb | Componente tare conexe: nod inexistent | 4 |
3 | 0ms | 1484kb | Componente tare conexe: gresit | 4 |
4 | 4ms | 1524kb | Componente tare conexe: gresit | 4 | 12 |
5 | 8ms | 1624kb | Componente tare conexe: gresit | 4 |
6 | 20ms | 1956kb | Componente tare conexe: gresit | 4 |
7 | 32ms | 2240kb | Componente tare conexe: gresit | 4 | 12 |
8 | 96ms | 3300kb | Componente tare conexe: gresit | 4 |
9 | 184ms | 5576kb | Componente tare conexe: gresit | 4 |
10 | 236ms | 7732kb | Componente tare conexe: gresit | 4 | 4 |
Punctaj total | 40 |