oj.uz

Submission #894641

# Submission time Handle Problem Language Result Execution time Memory
894641 2023-12-28T15:00:00 Z thunopro Making Friends on Joitter is Fun (JOI20_joitter2) C++14
1 / 100
 320 ms 596 KB 
#include<bits/stdc++.h>
using namespace std ;
#define maxn 200009 
#define ll long long
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define _lower(v,x) lower_bound(v.begin(),v.end(),x)-v.begin()+1 
#define re exit(0); 

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef vector<ll> vl ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 
typedef pair<ll,ll> pll ;  

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a < 0 ) a += mod ; 
	if ( a >= mod ) a -= mod ; 
}

template < typename T > void chkmin (T &a , T b) { if (a>b) a=b ;} 
template < typename T > void chkmax (T &a , T b) { if (a<b) a=b ;}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ; 
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow(a,n/2) ;
	if ( n % 2 ) return (1ll*res*res%mod*a%mod) ; 
	else return 1ll*res*res%mod ; 
}

int n , m ; 

bool adj [59][59] ; 
void sub1 () 
{
	int res = 0 ; 
	for ( int r = 1 ; r <= m ; r ++ ) 
	{
		int u , v ; cin >> u >> v ; 
		if ( adj [u][v] )
		{
			cout << res << "\n" ; 
			continue ;
		} 
		res ++ ; 
		adj [u][v] = 1 ; 
		while ( true ) 
		{
			bool change = false ; 
			for ( int i = 1 ; i <= n && !change ; i ++ ) 
			{
				for ( int j = 1 ; j <= n && !change; j ++ ) 
				{
					if ( i == j ) continue ; 
					for ( int k = 1 ; k <= n && !change ; k ++ ) 
					{
						if ( k == i || k == j ) continue ; 
						if ( adj [i][k] == 0 && adj [i][j] == 1 && adj [j][k] + adj [k][j] == 2 ) 
						{
							adj [i][k] = 1 ; change = true ; 
							res ++ ; 
						}
					}
				}
			}
			if ( ! change ) break ; 
		}
		cout << res << "\n" ; 
	}
}
int main () 
{
	ios_base::sync_with_stdio(0) ; 
	cin.tie(0) ; cout.tie(0) ; 
//	rf () ; 
	cin >> n >> m ; 
	
	if ( n <= 50 ) sub1 () ; 

}

Compilation message

joitter2.cpp: In function 'void rf()':
joitter2.cpp:35:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 320 ms 456 KB Output is correct
8 Correct 317 ms 456 KB Output is correct
9 Correct 304 ms 456 KB Output is correct
10 Correct 289 ms 348 KB Output is correct
11 Correct 275 ms 344 KB Output is correct
12 Correct 292 ms 348 KB Output is correct
13 Correct 282 ms 436 KB Output is correct
14 Correct 296 ms 344 KB Output is correct
15 Correct 297 ms 440 KB Output is correct
16 Correct 286 ms 596 KB Output is correct
17 Correct 300 ms 436 KB Output is correct
18 Correct 288 ms 348 KB Output is correct
19 Correct 292 ms 344 KB Output is correct
20 Correct 312 ms 440 KB Output is correct
21 Correct 300 ms 468 KB Output is correct
22 Correct 311 ms 436 KB Output is correct
23 Correct 309 ms 596 KB Output is correct
24 Correct 296 ms 440 KB Output is correct
25 Correct 308 ms 344 KB Output is correct
26 Correct 287 ms 436 KB Output is correct
27 Correct 308 ms 432 KB Output is correct
28 Correct 299 ms 436 KB Output is correct
29 Correct 304 ms 348 KB Output is correct
30 Correct 280 ms 432 KB Output is correct
31 Correct 279 ms 348 KB Output is correct
32 Correct 297 ms 440 KB Output is correct
33 Correct 307 ms 544 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 320 ms 456 KB Output is correct
8 Correct 317 ms 456 KB Output is correct
9 Correct 304 ms 456 KB Output is correct
10 Correct 289 ms 348 KB Output is correct
11 Correct 275 ms 344 KB Output is correct
12 Correct 292 ms 348 KB Output is correct
13 Correct 282 ms 436 KB Output is correct
14 Correct 296 ms 344 KB Output is correct
15 Correct 297 ms 440 KB Output is correct
16 Correct 286 ms 596 KB Output is correct
17 Correct 300 ms 436 KB Output is correct
18 Correct 288 ms 348 KB Output is correct
19 Correct 292 ms 344 KB Output is correct
20 Correct 312 ms 440 KB Output is correct
21 Correct 300 ms 468 KB Output is correct
22 Correct 311 ms 436 KB Output is correct
23 Correct 309 ms 596 KB Output is correct
24 Correct 296 ms 440 KB Output is correct
25 Correct 308 ms 344 KB Output is correct
26 Correct 287 ms 436 KB Output is correct
27 Correct 308 ms 432 KB Output is correct
28 Correct 299 ms 436 KB Output is correct
29 Correct 304 ms 348 KB Output is correct
30 Correct 280 ms 432 KB Output is correct
31 Correct 279 ms 348 KB Output is correct
32 Correct 297 ms 440 KB Output is correct
33 Correct 307 ms 544 KB Output is correct
34 Incorrect 0 ms 348 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 320 ms 456 KB Output is correct
8 Correct 317 ms 456 KB Output is correct
9 Correct 304 ms 456 KB Output is correct
10 Correct 289 ms 348 KB Output is correct
11 Correct 275 ms 344 KB Output is correct
12 Correct 292 ms 348 KB Output is correct
13 Correct 282 ms 436 KB Output is correct
14 Correct 296 ms 344 KB Output is correct
15 Correct 297 ms 440 KB Output is correct
16 Correct 286 ms 596 KB Output is correct
17 Correct 300 ms 436 KB Output is correct
18 Correct 288 ms 348 KB Output is correct
19 Correct 292 ms 344 KB Output is correct
20 Correct 312 ms 440 KB Output is correct
21 Correct 300 ms 468 KB Output is correct
22 Correct 311 ms 436 KB Output is correct
23 Correct 309 ms 596 KB Output is correct
24 Correct 296 ms 440 KB Output is correct
25 Correct 308 ms 344 KB Output is correct
26 Correct 287 ms 436 KB Output is correct
27 Correct 308 ms 432 KB Output is correct
28 Correct 299 ms 436 KB Output is correct
29 Correct 304 ms 348 KB Output is correct
30 Correct 280 ms 432 KB Output is correct
31 Correct 279 ms 348 KB Output is correct
32 Correct 297 ms 440 KB Output is correct
33 Correct 307 ms 544 KB Output is correct
34 Incorrect 0 ms 348 KB Output isn't correct
35 Halted 0 ms 0 KB -