oj.uz

Submission #51990

# Submission time Handle Problem Language Result Execution time Memory
51990 2018-06-22T22:14:28 Z pzdba Duathlon (APIO18_duathlon) C++14
100 / 100
 349 ms 71780 KB 
#include <bits/stdc++.h>
using namespace std;
#define NIL -1
typedef pair<int, int> pii;
typedef long long LL;

bool vis[100005];

class Edge
{
    public:
    int u;
    int v;
    Edge(int u, int v);
};
Edge::Edge(int u, int v)
{
    this->u = u;
    this->v = v;
}
  
// A class that represents an directed graph
class Graph
{
    int V;    // No. of vertices
    int E;    // No. of edges
    list<int> *adj;    // A dynamic array of adjacency lists
   
    // A Recursive DFS based function used by BCC()
    void BCCUtil(int u, int disc[], int low[],
                 list<Edge> *st, int parent[]);
public:
    Graph(int V);   // Constructor
    void addEdge(int v, int w);   // function to add an edge to graph
    void BCC();    // prints strongly connected components
};
   
Graph::Graph(int V)
{
    this->V = V;
    this->E = 0;
    adj = new list<int>[V];
}
   
void Graph::addEdge(int v, int w)
{
    adj[v].push_back(w);
    E++;
}


int cnt = 1;
set<int> com[100005];
   
// A recursive function that finds and prints strongly connected
// components using DFS traversal
// u --> The vertex to be visited next
// disc[] --> Stores discovery times of visited vertices
// low[] -- >> earliest visited vertex (the vertex with minimum
//             discovery time) that can be reached from subtree
//             rooted with current vertex
// *st -- >> To store visited edges
void Graph::BCCUtil(int u, int disc[], int low[], list<Edge> *st,
                    int parent[])
{
    // A static variable is used for simplicity, we can avoid use
    // of static variable by passing a pointer.
    static int time = 0;
   
    // Initialize discovery time and low value
    disc[u] = low[u] = ++time;
    int children = 0;
   
    // Go through all vertices adjacent to this
    list<int>::iterator i;
    for (i = adj[u].begin(); i != adj[u].end(); ++i)
    {
        int v = *i;  // v is current adjacent of 'u'
   
        // If v is not visited yet, then recur for it
        if (disc[v] == -1)
        {
            children++;
            parent[v] = u;
            //store the edge in stack
            st->push_back(Edge(u,v));
            BCCUtil(v, disc, low, st, parent);
   
            // Check if the subtree rooted with 'v' has a
            // connection to one of the ancestors of 'u'
            // Case 1 -- per Strongly Connected Components Article
            low[u]  = min(low[u], low[v]);
  
            //If u is an articulation point,
            //pop all edges from stack till u -- v
            if( (disc[u] == 1 && children > 1) ||
                (disc[u] > 1 && low[v] >= disc[u]) )
            {
                while(st->back().u != u || st->back().v != v)
                {
            		com[cnt].insert(st->back().u+1);
            		com[cnt].insert(st->back().v+1);
                    // cout << st->back().u << "--" << st->back().v << " ";
                    st->pop_back();
                }
	            com[cnt].insert(st->back().u+1);
	            com[cnt].insert(st->back().v+1);
                // cout << st->back().u << "--" << st->back().v;
                st->pop_back();
                cnt++;
            }
        }
   
        // Update low value of 'u' only of 'v' is still in stack
        // (i.e. it's a back edge, not cross edge).
        // Case 2 -- per Strongly Connected Components Article
        else if(v != parent[u] && disc[v] < low[u])
        {
            low[u]  = min(low[u], disc[v]);
            st->push_back(Edge(u,v));
        }
    }
}
   
// The function to do DFS traversal. It uses BCCUtil()
void Graph::BCC()
{
    int *disc = new int[V];
    int *low = new int[V];
    int *parent = new int[V];
    list<Edge> *st = new list<Edge>[E];
   
    // Initialize disc and low, and parent arrays
    for (int i = 0; i < V; i++)
    {
        disc[i] = NIL;
        low[i] = NIL;
        parent[i] = NIL;
    }
   
    for (int i = 0; i < V; i++)
    {
        if (disc[i] == NIL)
            BCCUtil(i, disc, low, st, parent);
          
        int j = 0;
        //If stack is not empty, pop all edges from stack
        while(st->size() > 0)
        {
            j = 1;
            com[cnt].insert(st->back().u+1);
            com[cnt].insert(st->back().v+1);
            // cout << st->back().u << "--" << st->back().v << " ";
            st->pop_back();
        }
        if(j == 1)
        {
        	cnt++;
            // cout << endl;
        }
    }
}

vector<int> gs[100005];
LL ans = 0;

LL s[100005], sc[100005];

void dfs(int u, int p){
	vis[u] = 1;
	s[u] += com[u].size();
	sc[u] += (LL)(com[u].size()-1)*(com[u].size()-1);
	for(auto its:com[u]){
		if(its == p) continue;
		LL s1 = 0;
		for(int i=0;i<gs[its].size();i++){
			int v = gs[its][i];
			if(vis[v]) continue;
			dfs(v, its);

			ans += sc[v]*(s[u]-1);
			ans += (s[v]-1)*(sc[u]);
			ans -= (s[v]-1)*(s[u]-1);

			s[u] += s[v]-1;
			sc[u] += sc[v];

			s1 += s[v]-1;
		}
		sc[u] += s1*(com[u].size()-1);
	}
}

int main(){
	int n, m;
	scanf("%d%d", &n, &m);
	Graph g(n);
	for(int i=0;i<m;i++){
		int a, b;
		scanf("%d%d", &a, &b);
		a--;
		b--;
		g.addEdge(a, b);
		g.addEdge(b, a);
	}
	g.BCC();
	cnt--;
	for(int i=1;i<=cnt;i++){
		for(auto its:com[i]) gs[its].push_back(i);
	}
	for(int i=1;i<=cnt;i++){
		if(vis[i]) continue;
		dfs(i, 0);
	}
	ans *= 2;
	for(int i=1;i<=cnt;i++){
		ans += (LL)(com[i].size())*(com[i].size()-1)*(com[i].size()-2);
	}
	printf("%lld\n", ans);
}

Compilation message

count_triplets.cpp: In function 'void dfs(int, int)':
count_triplets.cpp:176:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<gs[its].size();i++){
               ~^~~~~~~~~~~~~~~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:196:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
count_triplets.cpp:200:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7420 KB Output is correct
2 Correct 8 ms 7496 KB Output is correct
3 Correct 8 ms 7496 KB Output is correct
4 Correct 8 ms 7500 KB Output is correct
5 Correct 8 ms 7500 KB Output is correct
6 Correct 7 ms 7548 KB Output is correct
7 Correct 7 ms 7552 KB Output is correct
8 Correct 7 ms 7560 KB Output is correct
9 Correct 7 ms 7560 KB Output is correct
10 Correct 9 ms 7636 KB Output is correct
11 Correct 8 ms 7744 KB Output is correct
12 Correct 7 ms 7744 KB Output is correct
13 Correct 9 ms 7744 KB Output is correct
14 Correct 7 ms 7744 KB Output is correct
15 Correct 7 ms 7744 KB Output is correct
16 Correct 7 ms 7744 KB Output is correct
17 Correct 7 ms 7744 KB Output is correct
18 Correct 8 ms 7744 KB Output is correct
19 Correct 9 ms 7744 KB Output is correct
20 Correct 7 ms 7744 KB Output is correct
21 Correct 7 ms 7744 KB Output is correct
22 Correct 9 ms 7744 KB Output is correct
23 Correct 8 ms 7744 KB Output is correct
24 Correct 7 ms 7744 KB Output is correct
25 Correct 8 ms 7744 KB Output is correct
26 Correct 8 ms 7744 KB Output is correct
27 Correct 9 ms 7744 KB Output is correct
28 Correct 7 ms 7788 KB Output is correct
29 Correct 7 ms 7792 KB Output is correct
30 Correct 7 ms 7792 KB Output is correct
31 Correct 7 ms 7792 KB Output is correct
32 Correct 7 ms 7792 KB Output is correct
33 Correct 7 ms 7792 KB Output is correct
34 Correct 7 ms 7792 KB Output is correct
35 Correct 9 ms 7792 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7420 KB Output is correct
2 Correct 8 ms 7496 KB Output is correct
3 Correct 8 ms 7496 KB Output is correct
4 Correct 8 ms 7500 KB Output is correct
5 Correct 8 ms 7500 KB Output is correct
6 Correct 7 ms 7548 KB Output is correct
7 Correct 7 ms 7552 KB Output is correct
8 Correct 7 ms 7560 KB Output is correct
9 Correct 7 ms 7560 KB Output is correct
10 Correct 9 ms 7636 KB Output is correct
11 Correct 8 ms 7744 KB Output is correct
12 Correct 7 ms 7744 KB Output is correct
13 Correct 9 ms 7744 KB Output is correct
14 Correct 7 ms 7744 KB Output is correct
15 Correct 7 ms 7744 KB Output is correct
16 Correct 7 ms 7744 KB Output is correct
17 Correct 7 ms 7744 KB Output is correct
18 Correct 8 ms 7744 KB Output is correct
19 Correct 9 ms 7744 KB Output is correct
20 Correct 7 ms 7744 KB Output is correct
21 Correct 7 ms 7744 KB Output is correct
22 Correct 9 ms 7744 KB Output is correct
23 Correct 8 ms 7744 KB Output is correct
24 Correct 7 ms 7744 KB Output is correct
25 Correct 8 ms 7744 KB Output is correct
26 Correct 8 ms 7744 KB Output is correct
27 Correct 9 ms 7744 KB Output is correct
28 Correct 7 ms 7788 KB Output is correct
29 Correct 7 ms 7792 KB Output is correct
30 Correct 7 ms 7792 KB Output is correct
31 Correct 7 ms 7792 KB Output is correct
32 Correct 7 ms 7792 KB Output is correct
33 Correct 7 ms 7792 KB Output is correct
34 Correct 7 ms 7792 KB Output is correct
35 Correct 9 ms 7792 KB Output is correct
36 Correct 9 ms 7792 KB Output is correct
37 Correct 9 ms 7792 KB Output is correct
38 Correct 9 ms 7792 KB Output is correct
39 Correct 8 ms 7792 KB Output is correct
40 Correct 8 ms 7792 KB Output is correct
41 Correct 10 ms 7792 KB Output is correct
42 Correct 7 ms 7792 KB Output is correct
43 Correct 7 ms 7792 KB Output is correct
44 Correct 7 ms 7792 KB Output is correct
45 Correct 7 ms 7792 KB Output is correct
46 Correct 7 ms 7792 KB Output is correct
47 Correct 8 ms 7792 KB Output is correct
48 Correct 10 ms 7792 KB Output is correct
49 Correct 7 ms 7792 KB Output is correct
50 Correct 7 ms 7792 KB Output is correct
51 Correct 7 ms 7892 KB Output is correct
52 Correct 7 ms 7896 KB Output is correct
53 Correct 8 ms 7896 KB Output is correct
54 Correct 7 ms 7896 KB Output is correct
55 Correct 7 ms 7896 KB Output is correct
56 Correct 7 ms 7896 KB Output is correct
57 Correct 8 ms 7896 KB Output is correct
58 Correct 7 ms 7896 KB Output is correct
59 Correct 9 ms 7896 KB Output is correct
60 Correct 7 ms 7896 KB Output is correct
61 Correct 8 ms 7896 KB Output is correct
62 Correct 7 ms 7896 KB Output is correct
63 Correct 7 ms 7896 KB Output is correct
64 Correct 8 ms 7896 KB Output is correct
65 Correct 7 ms 7896 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 44352 KB Output is correct
2 Correct 216 ms 44384 KB Output is correct
3 Correct 190 ms 44384 KB Output is correct
4 Correct 185 ms 44384 KB Output is correct
5 Correct 174 ms 44384 KB Output is correct
6 Correct 180 ms 44384 KB Output is correct
7 Correct 165 ms 44384 KB Output is correct
8 Correct 163 ms 44384 KB Output is correct
9 Correct 192 ms 44384 KB Output is correct
10 Correct 243 ms 44384 KB Output is correct
11 Correct 116 ms 44384 KB Output is correct
12 Correct 117 ms 44384 KB Output is correct
13 Correct 105 ms 44384 KB Output is correct
14 Correct 104 ms 44384 KB Output is correct
15 Correct 74 ms 44384 KB Output is correct
16 Correct 103 ms 44384 KB Output is correct
17 Correct 13 ms 44384 KB Output is correct
18 Correct 13 ms 44384 KB Output is correct
19 Correct 11 ms 44384 KB Output is correct
20 Correct 12 ms 44384 KB Output is correct
21 Correct 11 ms 44384 KB Output is correct
22 Correct 11 ms 44384 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 44384 KB Output is correct
2 Correct 8 ms 44384 KB Output is correct
3 Correct 9 ms 44384 KB Output is correct
4 Correct 8 ms 44384 KB Output is correct
5 Correct 10 ms 44384 KB Output is correct
6 Correct 11 ms 44384 KB Output is correct
7 Correct 9 ms 44384 KB Output is correct
8 Correct 11 ms 44384 KB Output is correct
9 Correct 8 ms 44384 KB Output is correct
10 Correct 9 ms 44384 KB Output is correct
11 Correct 8 ms 44384 KB Output is correct
12 Correct 9 ms 44384 KB Output is correct
13 Correct 8 ms 44384 KB Output is correct
14 Correct 8 ms 44384 KB Output is correct
15 Correct 9 ms 44384 KB Output is correct
16 Correct 8 ms 44384 KB Output is correct
17 Correct 8 ms 44384 KB Output is correct
18 Correct 8 ms 44384 KB Output is correct
19 Correct 8 ms 44384 KB Output is correct
20 Correct 8 ms 44384 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 44384 KB Output is correct
2 Correct 172 ms 44384 KB Output is correct
3 Correct 163 ms 44384 KB Output is correct
4 Correct 159 ms 44384 KB Output is correct
5 Correct 161 ms 44384 KB Output is correct
6 Correct 196 ms 45900 KB Output is correct
7 Correct 228 ms 45900 KB Output is correct
8 Correct 248 ms 45900 KB Output is correct
9 Correct 200 ms 45900 KB Output is correct
10 Correct 171 ms 45900 KB Output is correct
11 Correct 180 ms 45900 KB Output is correct
12 Correct 177 ms 45900 KB Output is correct
13 Correct 240 ms 45900 KB Output is correct
14 Correct 141 ms 45900 KB Output is correct
15 Correct 135 ms 45900 KB Output is correct
16 Correct 77 ms 45900 KB Output is correct
17 Correct 125 ms 45900 KB Output is correct
18 Correct 178 ms 45900 KB Output is correct
19 Correct 134 ms 45900 KB Output is correct
20 Correct 133 ms 45900 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 45900 KB Output is correct
2 Correct 8 ms 45900 KB Output is correct
3 Correct 7 ms 45900 KB Output is correct
4 Correct 8 ms 45900 KB Output is correct
5 Correct 8 ms 45900 KB Output is correct
6 Correct 9 ms 45900 KB Output is correct
7 Correct 8 ms 45900 KB Output is correct
8 Correct 8 ms 45900 KB Output is correct
9 Correct 8 ms 45900 KB Output is correct
10 Correct 9 ms 45900 KB Output is correct
11 Correct 8 ms 45900 KB Output is correct
12 Correct 9 ms 45900 KB Output is correct
13 Correct 8 ms 45900 KB Output is correct
14 Correct 8 ms 45900 KB Output is correct
15 Correct 8 ms 45900 KB Output is correct
16 Correct 8 ms 45900 KB Output is correct
17 Correct 8 ms 45900 KB Output is correct
18 Correct 8 ms 45900 KB Output is correct
19 Correct 8 ms 45900 KB Output is correct
20 Correct 8 ms 45900 KB Output is correct
21 Correct 7 ms 45900 KB Output is correct
22 Correct 8 ms 45900 KB Output is correct
23 Correct 8 ms 45900 KB Output is correct
24 Correct 8 ms 45900 KB Output is correct
25 Correct 8 ms 45900 KB Output is correct
26 Correct 8 ms 45900 KB Output is correct
27 Correct 7 ms 45900 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 45900 KB Output is correct
2 Correct 168 ms 45900 KB Output is correct
3 Correct 221 ms 45900 KB Output is correct
4 Correct 169 ms 45900 KB Output is correct
5 Correct 198 ms 45900 KB Output is correct
6 Correct 197 ms 45900 KB Output is correct
7 Correct 157 ms 45900 KB Output is correct
8 Correct 187 ms 45900 KB Output is correct
9 Correct 153 ms 45900 KB Output is correct
10 Correct 156 ms 45900 KB Output is correct
11 Correct 160 ms 45900 KB Output is correct
12 Correct 158 ms 45900 KB Output is correct
13 Correct 172 ms 45900 KB Output is correct
14 Correct 171 ms 45900 KB Output is correct
15 Correct 204 ms 45900 KB Output is correct
16 Correct 218 ms 45900 KB Output is correct
17 Correct 201 ms 45900 KB Output is correct
18 Correct 210 ms 45900 KB Output is correct
19 Correct 188 ms 45900 KB Output is correct
20 Correct 227 ms 45900 KB Output is correct
21 Correct 234 ms 45900 KB Output is correct
22 Correct 158 ms 45900 KB Output is correct
23 Correct 178 ms 45900 KB Output is correct
24 Correct 209 ms 45900 KB Output is correct
25 Correct 219 ms 45900 KB Output is correct
26 Correct 280 ms 45900 KB Output is correct
27 Correct 222 ms 45900 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7420 KB Output is correct
2 Correct 8 ms 7496 KB Output is correct
3 Correct 8 ms 7496 KB Output is correct
4 Correct 8 ms 7500 KB Output is correct
5 Correct 8 ms 7500 KB Output is correct
6 Correct 7 ms 7548 KB Output is correct
7 Correct 7 ms 7552 KB Output is correct
8 Correct 7 ms 7560 KB Output is correct
9 Correct 7 ms 7560 KB Output is correct
10 Correct 9 ms 7636 KB Output is correct
11 Correct 8 ms 7744 KB Output is correct
12 Correct 7 ms 7744 KB Output is correct
13 Correct 9 ms 7744 KB Output is correct
14 Correct 7 ms 7744 KB Output is correct
15 Correct 7 ms 7744 KB Output is correct
16 Correct 7 ms 7744 KB Output is correct
17 Correct 7 ms 7744 KB Output is correct
18 Correct 8 ms 7744 KB Output is correct
19 Correct 9 ms 7744 KB Output is correct
20 Correct 7 ms 7744 KB Output is correct
21 Correct 7 ms 7744 KB Output is correct
22 Correct 9 ms 7744 KB Output is correct
23 Correct 8 ms 7744 KB Output is correct
24 Correct 7 ms 7744 KB Output is correct
25 Correct 8 ms 7744 KB Output is correct
26 Correct 8 ms 7744 KB Output is correct
27 Correct 9 ms 7744 KB Output is correct
28 Correct 7 ms 7788 KB Output is correct
29 Correct 7 ms 7792 KB Output is correct
30 Correct 7 ms 7792 KB Output is correct
31 Correct 7 ms 7792 KB Output is correct
32 Correct 7 ms 7792 KB Output is correct
33 Correct 7 ms 7792 KB Output is correct
34 Correct 7 ms 7792 KB Output is correct
35 Correct 9 ms 7792 KB Output is correct
36 Correct 9 ms 7792 KB Output is correct
37 Correct 9 ms 7792 KB Output is correct
38 Correct 9 ms 7792 KB Output is correct
39 Correct 8 ms 7792 KB Output is correct
40 Correct 8 ms 7792 KB Output is correct
41 Correct 10 ms 7792 KB Output is correct
42 Correct 7 ms 7792 KB Output is correct
43 Correct 7 ms 7792 KB Output is correct
44 Correct 7 ms 7792 KB Output is correct
45 Correct 7 ms 7792 KB Output is correct
46 Correct 7 ms 7792 KB Output is correct
47 Correct 8 ms 7792 KB Output is correct
48 Correct 10 ms 7792 KB Output is correct
49 Correct 7 ms 7792 KB Output is correct
50 Correct 7 ms 7792 KB Output is correct
51 Correct 7 ms 7892 KB Output is correct
52 Correct 7 ms 7896 KB Output is correct
53 Correct 8 ms 7896 KB Output is correct
54 Correct 7 ms 7896 KB Output is correct
55 Correct 7 ms 7896 KB Output is correct
56 Correct 7 ms 7896 KB Output is correct
57 Correct 8 ms 7896 KB Output is correct
58 Correct 7 ms 7896 KB Output is correct
59 Correct 9 ms 7896 KB Output is correct
60 Correct 7 ms 7896 KB Output is correct
61 Correct 8 ms 7896 KB Output is correct
62 Correct 7 ms 7896 KB Output is correct
63 Correct 7 ms 7896 KB Output is correct
64 Correct 8 ms 7896 KB Output is correct
65 Correct 7 ms 7896 KB Output is correct
66 Correct 8 ms 45900 KB Output is correct
67 Correct 10 ms 45900 KB Output is correct
68 Correct 8 ms 45900 KB Output is correct
69 Correct 11 ms 45900 KB Output is correct
70 Correct 9 ms 45900 KB Output is correct
71 Correct 10 ms 45900 KB Output is correct
72 Correct 10 ms 45900 KB Output is correct
73 Correct 8 ms 45900 KB Output is correct
74 Correct 11 ms 45900 KB Output is correct
75 Correct 8 ms 45900 KB Output is correct
76 Correct 8 ms 45900 KB Output is correct
77 Correct 10 ms 45900 KB Output is correct
78 Correct 10 ms 45900 KB Output is correct
79 Correct 9 ms 45900 KB Output is correct
80 Correct 10 ms 45900 KB Output is correct
81 Correct 9 ms 45900 KB Output is correct
82 Correct 9 ms 45900 KB Output is correct
83 Correct 9 ms 45900 KB Output is correct
84 Correct 9 ms 45900 KB Output is correct
85 Correct 9 ms 45900 KB Output is correct
86 Correct 10 ms 45900 KB Output is correct
87 Correct 11 ms 45900 KB Output is correct
88 Correct 9 ms 45900 KB Output is correct
89 Correct 8 ms 45900 KB Output is correct
90 Correct 12 ms 45900 KB Output is correct
91 Correct 8 ms 45900 KB Output is correct
92 Correct 9 ms 45900 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7420 KB Output is correct
2 Correct 8 ms 7496 KB Output is correct
3 Correct 8 ms 7496 KB Output is correct
4 Correct 8 ms 7500 KB Output is correct
5 Correct 8 ms 7500 KB Output is correct
6 Correct 7 ms 7548 KB Output is correct
7 Correct 7 ms 7552 KB Output is correct
8 Correct 7 ms 7560 KB Output is correct
9 Correct 7 ms 7560 KB Output is correct
10 Correct 9 ms 7636 KB Output is correct
11 Correct 8 ms 7744 KB Output is correct
12 Correct 7 ms 7744 KB Output is correct
13 Correct 9 ms 7744 KB Output is correct
14 Correct 7 ms 7744 KB Output is correct
15 Correct 7 ms 7744 KB Output is correct
16 Correct 7 ms 7744 KB Output is correct
17 Correct 7 ms 7744 KB Output is correct
18 Correct 8 ms 7744 KB Output is correct
19 Correct 9 ms 7744 KB Output is correct
20 Correct 7 ms 7744 KB Output is correct
21 Correct 7 ms 7744 KB Output is correct
22 Correct 9 ms 7744 KB Output is correct
23 Correct 8 ms 7744 KB Output is correct
24 Correct 7 ms 7744 KB Output is correct
25 Correct 8 ms 7744 KB Output is correct
26 Correct 8 ms 7744 KB Output is correct
27 Correct 9 ms 7744 KB Output is correct
28 Correct 7 ms 7788 KB Output is correct
29 Correct 7 ms 7792 KB Output is correct
30 Correct 7 ms 7792 KB Output is correct
31 Correct 7 ms 7792 KB Output is correct
32 Correct 7 ms 7792 KB Output is correct
33 Correct 7 ms 7792 KB Output is correct
34 Correct 7 ms 7792 KB Output is correct
35 Correct 9 ms 7792 KB Output is correct
36 Correct 9 ms 7792 KB Output is correct
37 Correct 9 ms 7792 KB Output is correct
38 Correct 9 ms 7792 KB Output is correct
39 Correct 8 ms 7792 KB Output is correct
40 Correct 8 ms 7792 KB Output is correct
41 Correct 10 ms 7792 KB Output is correct
42 Correct 7 ms 7792 KB Output is correct
43 Correct 7 ms 7792 KB Output is correct
44 Correct 7 ms 7792 KB Output is correct
45 Correct 7 ms 7792 KB Output is correct
46 Correct 7 ms 7792 KB Output is correct
47 Correct 8 ms 7792 KB Output is correct
48 Correct 10 ms 7792 KB Output is correct
49 Correct 7 ms 7792 KB Output is correct
50 Correct 7 ms 7792 KB Output is correct
51 Correct 7 ms 7892 KB Output is correct
52 Correct 7 ms 7896 KB Output is correct
53 Correct 8 ms 7896 KB Output is correct
54 Correct 7 ms 7896 KB Output is correct
55 Correct 7 ms 7896 KB Output is correct
56 Correct 7 ms 7896 KB Output is correct
57 Correct 8 ms 7896 KB Output is correct
58 Correct 7 ms 7896 KB Output is correct
59 Correct 9 ms 7896 KB Output is correct
60 Correct 7 ms 7896 KB Output is correct
61 Correct 8 ms 7896 KB Output is correct
62 Correct 7 ms 7896 KB Output is correct
63 Correct 7 ms 7896 KB Output is correct
64 Correct 8 ms 7896 KB Output is correct
65 Correct 7 ms 7896 KB Output is correct
66 Correct 186 ms 44352 KB Output is correct
67 Correct 216 ms 44384 KB Output is correct
68 Correct 190 ms 44384 KB Output is correct
69 Correct 185 ms 44384 KB Output is correct
70 Correct 174 ms 44384 KB Output is correct
71 Correct 180 ms 44384 KB Output is correct
72 Correct 165 ms 44384 KB Output is correct
73 Correct 163 ms 44384 KB Output is correct
74 Correct 192 ms 44384 KB Output is correct
75 Correct 243 ms 44384 KB Output is correct
76 Correct 116 ms 44384 KB Output is correct
77 Correct 117 ms 44384 KB Output is correct
78 Correct 105 ms 44384 KB Output is correct
79 Correct 104 ms 44384 KB Output is correct
80 Correct 74 ms 44384 KB Output is correct
81 Correct 103 ms 44384 KB Output is correct
82 Correct 13 ms 44384 KB Output is correct
83 Correct 13 ms 44384 KB Output is correct
84 Correct 11 ms 44384 KB Output is correct
85 Correct 12 ms 44384 KB Output is correct
86 Correct 11 ms 44384 KB Output is correct
87 Correct 11 ms 44384 KB Output is correct
88 Correct 9 ms 44384 KB Output is correct
89 Correct 8 ms 44384 KB Output is correct
90 Correct 9 ms 44384 KB Output is correct
91 Correct 8 ms 44384 KB Output is correct
92 Correct 10 ms 44384 KB Output is correct
93 Correct 11 ms 44384 KB Output is correct
94 Correct 9 ms 44384 KB Output is correct
95 Correct 11 ms 44384 KB Output is correct
96 Correct 8 ms 44384 KB Output is correct
97 Correct 9 ms 44384 KB Output is correct
98 Correct 8 ms 44384 KB Output is correct
99 Correct 9 ms 44384 KB Output is correct
100 Correct 8 ms 44384 KB Output is correct
101 Correct 8 ms 44384 KB Output is correct
102 Correct 9 ms 44384 KB Output is correct
103 Correct 8 ms 44384 KB Output is correct
104 Correct 8 ms 44384 KB Output is correct
105 Correct 8 ms 44384 KB Output is correct
106 Correct 8 ms 44384 KB Output is correct
107 Correct 8 ms 44384 KB Output is correct
108 Correct 165 ms 44384 KB Output is correct
109 Correct 172 ms 44384 KB Output is correct
110 Correct 163 ms 44384 KB Output is correct
111 Correct 159 ms 44384 KB Output is correct
112 Correct 161 ms 44384 KB Output is correct
113 Correct 196 ms 45900 KB Output is correct
114 Correct 228 ms 45900 KB Output is correct
115 Correct 248 ms 45900 KB Output is correct
116 Correct 200 ms 45900 KB Output is correct
117 Correct 171 ms 45900 KB Output is correct
118 Correct 180 ms 45900 KB Output is correct
119 Correct 177 ms 45900 KB Output is correct
120 Correct 240 ms 45900 KB Output is correct
121 Correct 141 ms 45900 KB Output is correct
122 Correct 135 ms 45900 KB Output is correct
123 Correct 77 ms 45900 KB Output is correct
124 Correct 125 ms 45900 KB Output is correct
125 Correct 178 ms 45900 KB Output is correct
126 Correct 134 ms 45900 KB Output is correct
127 Correct 133 ms 45900 KB Output is correct
128 Correct 8 ms 45900 KB Output is correct
129 Correct 8 ms 45900 KB Output is correct
130 Correct 7 ms 45900 KB Output is correct
131 Correct 8 ms 45900 KB Output is correct
132 Correct 8 ms 45900 KB Output is correct
133 Correct 9 ms 45900 KB Output is correct
134 Correct 8 ms 45900 KB Output is correct
135 Correct 8 ms 45900 KB Output is correct
136 Correct 8 ms 45900 KB Output is correct
137 Correct 9 ms 45900 KB Output is correct
138 Correct 8 ms 45900 KB Output is correct
139 Correct 9 ms 45900 KB Output is correct
140 Correct 8 ms 45900 KB Output is correct
141 Correct 8 ms 45900 KB Output is correct
142 Correct 8 ms 45900 KB Output is correct
143 Correct 8 ms 45900 KB Output is correct
144 Correct 8 ms 45900 KB Output is correct
145 Correct 8 ms 45900 KB Output is correct
146 Correct 8 ms 45900 KB Output is correct
147 Correct 8 ms 45900 KB Output is correct
148 Correct 7 ms 45900 KB Output is correct
149 Correct 8 ms 45900 KB Output is correct
150 Correct 8 ms 45900 KB Output is correct
151 Correct 8 ms 45900 KB Output is correct
152 Correct 8 ms 45900 KB Output is correct
153 Correct 8 ms 45900 KB Output is correct
154 Correct 7 ms 45900 KB Output is correct
155 Correct 166 ms 45900 KB Output is correct
156 Correct 168 ms 45900 KB Output is correct
157 Correct 221 ms 45900 KB Output is correct
158 Correct 169 ms 45900 KB Output is correct
159 Correct 198 ms 45900 KB Output is correct
160 Correct 197 ms 45900 KB Output is correct
161 Correct 157 ms 45900 KB Output is correct
162 Correct 187 ms 45900 KB Output is correct
163 Correct 153 ms 45900 KB Output is correct
164 Correct 156 ms 45900 KB Output is correct
165 Correct 160 ms 45900 KB Output is correct
166 Correct 158 ms 45900 KB Output is correct
167 Correct 172 ms 45900 KB Output is correct
168 Correct 171 ms 45900 KB Output is correct
169 Correct 204 ms 45900 KB Output is correct
170 Correct 218 ms 45900 KB Output is correct
171 Correct 201 ms 45900 KB Output is correct
172 Correct 210 ms 45900 KB Output is correct
173 Correct 188 ms 45900 KB Output is correct
174 Correct 227 ms 45900 KB Output is correct
175 Correct 234 ms 45900 KB Output is correct
176 Correct 158 ms 45900 KB Output is correct
177 Correct 178 ms 45900 KB Output is correct
178 Correct 209 ms 45900 KB Output is correct
179 Correct 219 ms 45900 KB Output is correct
180 Correct 280 ms 45900 KB Output is correct
181 Correct 222 ms 45900 KB Output is correct
182 Correct 8 ms 45900 KB Output is correct
183 Correct 10 ms 45900 KB Output is correct
184 Correct 8 ms 45900 KB Output is correct
185 Correct 11 ms 45900 KB Output is correct
186 Correct 9 ms 45900 KB Output is correct
187 Correct 10 ms 45900 KB Output is correct
188 Correct 10 ms 45900 KB Output is correct
189 Correct 8 ms 45900 KB Output is correct
190 Correct 11 ms 45900 KB Output is correct
191 Correct 8 ms 45900 KB Output is correct
192 Correct 8 ms 45900 KB Output is correct
193 Correct 10 ms 45900 KB Output is correct
194 Correct 10 ms 45900 KB Output is correct
195 Correct 9 ms 45900 KB Output is correct
196 Correct 10 ms 45900 KB Output is correct
197 Correct 9 ms 45900 KB Output is correct
198 Correct 9 ms 45900 KB Output is correct
199 Correct 9 ms 45900 KB Output is correct
200 Correct 9 ms 45900 KB Output is correct
201 Correct 9 ms 45900 KB Output is correct
202 Correct 10 ms 45900 KB Output is correct
203 Correct 11 ms 45900 KB Output is correct
204 Correct 9 ms 45900 KB Output is correct
205 Correct 8 ms 45900 KB Output is correct
206 Correct 12 ms 45900 KB Output is correct
207 Correct 8 ms 45900 KB Output is correct
208 Correct 9 ms 45900 KB Output is correct
209 Correct 13 ms 45900 KB Output is correct
210 Correct 94 ms 45900 KB Output is correct
211 Correct 223 ms 45900 KB Output is correct
212 Correct 299 ms 47204 KB Output is correct
213 Correct 349 ms 56576 KB Output is correct
214 Correct 180 ms 56576 KB Output is correct
215 Correct 89 ms 56576 KB Output is correct
216 Correct 183 ms 56576 KB Output is correct
217 Correct 179 ms 56576 KB Output is correct
218 Correct 168 ms 56576 KB Output is correct
219 Correct 159 ms 56576 KB Output is correct
220 Correct 201 ms 56576 KB Output is correct
221 Correct 154 ms 56576 KB Output is correct
222 Correct 191 ms 56576 KB Output is correct
223 Correct 230 ms 62276 KB Output is correct
224 Correct 214 ms 62760 KB Output is correct
225 Correct 224 ms 62760 KB Output is correct
226 Correct 248 ms 62760 KB Output is correct
227 Correct 245 ms 64008 KB Output is correct
228 Correct 309 ms 64008 KB Output is correct
229 Correct 176 ms 64008 KB Output is correct
230 Correct 228 ms 69988 KB Output is correct
231 Correct 218 ms 71780 KB Output is correct