oj.uz

Submission #264977

# Submission time Handle Problem Language Result Execution time Memory
264977 2020-08-14T11:57:30 Z dsjong Duathlon (APIO18_duathlon) C++14
0 / 100
 1000 ms 19604 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int>cur;
bool g[12][12], vis[12];
int n, m;
set<pair<pair<int, int>, int>>ans;
void go(){
	for(int i=0;i<cur.size();i++){
		for(int j=i+1;j<cur.size();j++){
			for(int k=j+1;k<cur.size();k++){
				ans.insert({{cur[i], cur[j]}, cur[k]});
			}
		}
	}
	if(cur.size()==n) return;
	for(int i=1;i<=n;i++){
		if(vis[i]) continue;
		if(!cur.empty() && !g[cur.back()][i]) continue;
		cur.push_back(i);
		vis[i]=true;
		go();
		cur.pop_back();
		vis[i]=false;
	}
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int x, y;
		cin>>x>>y;
		g[x][y]=g[y][x]=true;
	}
	go();
	cout<<ans.size();
}

Compilation message

count_triplets.cpp: In function 'void go()':
count_triplets.cpp:8:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |  for(int i=0;i<cur.size();i++){
      |              ~^~~~~~~~~~~
count_triplets.cpp:9:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |   for(int j=i+1;j<cur.size();j++){
      |                 ~^~~~~~~~~~~
count_triplets.cpp:10:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |    for(int k=j+1;k<cur.size();k++){
      |                  ~^~~~~~~~~~~
count_triplets.cpp:15:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   15 |  if(cur.size()==n) return;
      |     ~~~~~~~~~~^~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 23 ms 384 KB Output is correct
9 Execution timed out 1095 ms 384 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 23 ms 384 KB Output is correct
9 Execution timed out 1095 ms 384 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 640 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 19604 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 23 ms 384 KB Output is correct
9 Execution timed out 1095 ms 384 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 23 ms 384 KB Output is correct
9 Execution timed out 1095 ms 384 KB Time limit exceeded
10 Halted 0 ms 0 KB -