oj.uz

Submission #1041609

# Submission time Handle Problem Language Result Execution time Memory
1041609 2024-08-02T06:12:33 Z 김은성(#11000) Brought Down the Grading Server? (CEOI23_balance) C++17
0 / 100
 32 ms 11080 KB 
#include <bits/stdc++.h>
using namespace std;
int n, s, t, *a[100009];
vector<pair<int, int> > graph[100009];
int ans[100009];
int deg[100009];	//out - in
void findcycle(int v){
	for(auto [idx, u]: graph[v]){
		if(ans[idx] != -1)
			continue;
		if(deg[v] < 0){
			ans[idx] = v;
			deg[v]++;
			deg[u]--;
		}
		else{
			ans[idx] = u;
			deg[v]--;
			deg[u]++;
		}
	}
}
int main(){
	int i, j;
	scanf("%d %d %d", &n, &s, &t);
	memset(ans, -1, sizeof(ans));
	for(i=0; i<n; i++){
		a[i] = (int*)malloc(s * sizeof(int));
		for(j=0; j<s; j++){
			scanf("%d", &a[i][j]);
		}
		graph[a[i][0]].push_back(make_pair(i, a[i][1]));
		graph[a[i][1]].push_back(make_pair(i, a[i][0]));
	}
	for(i=1; i<=t; i++){
		findcycle(i);
	}
	for(i=0; i<n; i++){
		printf("%d %d\n", ans[i], a[i][0] + a[i][1] - ans[i]);
	}
}

Compilation message

balance.cpp: In function 'int main()':
balance.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |  scanf("%d %d %d", &n, &s, &t);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
balance.cpp:30:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |    scanf("%d", &a[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3160 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3164 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
2 Halted 0 ms 0 KB -

Subtask #2-1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 11080 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
2 Halted 0 ms 0 KB -

Subtask #2-2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 11080 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
2 Halted 0 ms 0 KB -

Subtask #2-3
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3164 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
2 Halted 0 ms 0 KB -

Subtask #3-1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3164 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3-2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3164 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3-3
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3164 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4-1
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 11080 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
2 Halted 0 ms 0 KB -

Subtask #4-2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 11080 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
2 Halted 0 ms 0 KB -

Subtask #4-3
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3160 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
2 Halted 0 ms 0 KB -